YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:36:55,708 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:36:55,710 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:36:55,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:36:55,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:36:55,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:36:55,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:36:55,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:36:55,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:36:55,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:36:55,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:36:55,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:36:55,729 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:36:55,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:36:55,731 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:36:55,732 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:36:55,733 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:36:55,735 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:36:55,736 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:36:55,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:36:55,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:36:55,740 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:36:55,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:36:55,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:36:55,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:36:55,743 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:36:55,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:36:55,744 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:36:55,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:36:55,745 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:36:55,746 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:36:55,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:36:55,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:36:55,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:36:55,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:36:55,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:36:55,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:36:55,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:36:55,750 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:36:55,750 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:36:55,764 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:36:55,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:36:55,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:36:55,766 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:36:55,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:36:55,766 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:36:55,766 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:36:55,766 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:36:55,767 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:36:55,767 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:36:55,767 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:36:55,767 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:36:55,767 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:36:55,768 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:36:55,768 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:36:55,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:36:55,768 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:36:55,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:36:55,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:36:55,769 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:36:55,769 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:36:55,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:36:55,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:36:55,769 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:36:55,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:36:55,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:36:55,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:36:55,770 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:36:55,770 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:36:55,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:36:55,808 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:36:55,812 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:36:55,813 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:36:55,813 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:36:55,814 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:36:55,883 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/2de15151e8c74b0085342d87ea64e309/FLAGabc23e460 [2020-06-22 09:36:56,225 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:36:56,226 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:36:56,226 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:36:56,232 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/2de15151e8c74b0085342d87ea64e309/FLAGabc23e460 [2020-06-22 09:36:56,630 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/2de15151e8c74b0085342d87ea64e309 [2020-06-22 09:36:56,642 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:36:56,643 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:36:56,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:36:56,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:36:56,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:36:56,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:56,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b3b233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56, skipping insertion in model container [2020-06-22 09:36:56,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:56,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:36:56,676 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:36:56,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:36:56,909 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:36:56,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:36:56,945 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:36:56,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56 WrapperNode [2020-06-22 09:36:56,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:36:56,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:36:56,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:36:56,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:36:56,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:56,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:56,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:36:56,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:36:56,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:36:56,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:36:56,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:56,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:57,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:57,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:57,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:57,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:57,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... [2020-06-22 09:36:57,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:36:57,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:36:57,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:36:57,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:36:57,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:36:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:36:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:36:57,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:36:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:36:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:36:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:36:57,428 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:36:57,429 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:36:57,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:36:57 BoogieIcfgContainer [2020-06-22 09:36:57,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:36:57,431 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:36:57,431 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:36:57,433 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:36:57,434 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:36:57" (1/1) ... [2020-06-22 09:36:57,453 INFO L313 BlockEncoder]: Initial Icfg 50 locations, 53 edges [2020-06-22 09:36:57,455 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:36:57,455 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:36:57,456 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:36:57,456 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:36:57,458 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:36:57,459 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:36:57,459 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:36:57,484 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:36:57,522 INFO L200 BlockEncoder]: SBE split 28 edges [2020-06-22 09:36:57,527 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:36:57,529 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:36:57,554 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 09:36:57,556 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 09:36:57,558 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:36:57,558 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:36:57,558 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:36:57,559 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:36:57,560 INFO L313 BlockEncoder]: Encoded RCFG 43 locations, 78 edges [2020-06-22 09:36:57,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:36:57 BasicIcfg [2020-06-22 09:36:57,560 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:36:57,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:36:57,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:36:57,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:36:57,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:36:56" (1/4) ... [2020-06-22 09:36:57,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa3b4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:36:57, skipping insertion in model container [2020-06-22 09:36:57,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (2/4) ... [2020-06-22 09:36:57,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa3b4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:36:57, skipping insertion in model container [2020-06-22 09:36:57,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:36:57" (3/4) ... [2020-06-22 09:36:57,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa3b4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:36:57, skipping insertion in model container [2020-06-22 09:36:57,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:36:57" (4/4) ... [2020-06-22 09:36:57,568 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:36:57,578 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:36:57,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-06-22 09:36:57,602 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-06-22 09:36:57,631 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:36:57,632 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:36:57,632 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:36:57,632 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:36:57,632 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:36:57,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:36:57,632 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:36:57,633 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:36:57,633 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:36:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-06-22 09:36:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:36:57,654 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:36:57,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:36:57,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 09:36:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash 120441, now seen corresponding path program 1 times [2020-06-22 09:36:57,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:57,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:57,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:57,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:57,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:57,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:36:57,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:36:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:57,870 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-06-22 09:36:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:58,061 INFO L93 Difference]: Finished difference Result 43 states and 78 transitions. [2020-06-22 09:36:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:58,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:36:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:36:58,076 INFO L225 Difference]: With dead ends: 43 [2020-06-22 09:36:58,076 INFO L226 Difference]: Without dead ends: 38 [2020-06-22 09:36:58,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-06-22 09:36:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-06-22 09:36:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 09:36:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 68 transitions. [2020-06-22 09:36:58,121 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 68 transitions. Word has length 3 [2020-06-22 09:36:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:36:58,122 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 68 transitions. [2020-06-22 09:36:58,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:36:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 68 transitions. [2020-06-22 09:36:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:36:58,123 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:36:58,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:36:58,124 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 09:36:58,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 120443, now seen corresponding path program 1 times [2020-06-22 09:36:58,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:58,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:58,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:58,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:58,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:36:58,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:36:58,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,171 INFO L87 Difference]: Start difference. First operand 38 states and 68 transitions. Second operand 3 states. [2020-06-22 09:36:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:58,287 INFO L93 Difference]: Finished difference Result 38 states and 68 transitions. [2020-06-22 09:36:58,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:58,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:36:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:36:58,288 INFO L225 Difference]: With dead ends: 38 [2020-06-22 09:36:58,289 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 09:36:58,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 09:36:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 09:36:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 09:36:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 58 transitions. [2020-06-22 09:36:58,295 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 58 transitions. Word has length 3 [2020-06-22 09:36:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:36:58,295 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 58 transitions. [2020-06-22 09:36:58,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:36:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 58 transitions. [2020-06-22 09:36:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:36:58,296 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:36:58,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:36:58,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 09:36:58,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash 3731170, now seen corresponding path program 1 times [2020-06-22 09:36:58,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:58,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:58,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:36:58,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:36:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,345 INFO L87 Difference]: Start difference. First operand 33 states and 58 transitions. Second operand 3 states. [2020-06-22 09:36:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:58,438 INFO L93 Difference]: Finished difference Result 33 states and 58 transitions. [2020-06-22 09:36:58,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:58,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:36:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:36:58,439 INFO L225 Difference]: With dead ends: 33 [2020-06-22 09:36:58,439 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 09:36:58,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 09:36:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 09:36:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:36:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. [2020-06-22 09:36:58,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 52 transitions. Word has length 4 [2020-06-22 09:36:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:36:58,444 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 52 transitions. [2020-06-22 09:36:58,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:36:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 52 transitions. [2020-06-22 09:36:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:36:58,445 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:36:58,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:36:58,445 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 09:36:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash 3731172, now seen corresponding path program 1 times [2020-06-22 09:36:58,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:58,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:58,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:58,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:36:58,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:36:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,476 INFO L87 Difference]: Start difference. First operand 30 states and 52 transitions. Second operand 3 states. [2020-06-22 09:36:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:58,550 INFO L93 Difference]: Finished difference Result 33 states and 52 transitions. [2020-06-22 09:36:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:58,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:36:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:36:58,551 INFO L225 Difference]: With dead ends: 33 [2020-06-22 09:36:58,551 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 09:36:58,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 09:36:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 09:36:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:36:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2020-06-22 09:36:58,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 4 [2020-06-22 09:36:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:36:58,557 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2020-06-22 09:36:58,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:36:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2020-06-22 09:36:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:36:58,558 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:36:58,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:36:58,558 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 09:36:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash 3731173, now seen corresponding path program 1 times [2020-06-22 09:36:58,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:58,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:58,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:58,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:36:58,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:36:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:58,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,601 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2020-06-22 09:36:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:58,712 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions. [2020-06-22 09:36:58,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:58,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:36:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:36:58,715 INFO L225 Difference]: With dead ends: 30 [2020-06-22 09:36:58,715 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:36:58,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:36:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:36:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:36:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-06-22 09:36:58,720 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 4 [2020-06-22 09:36:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:36:58,720 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-06-22 09:36:58,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:36:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-06-22 09:36:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:36:58,721 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:36:58,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:36:58,721 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 09:36:58,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:58,721 INFO L82 PathProgramCache]: Analyzing trace with hash 115665044, now seen corresponding path program 1 times [2020-06-22 09:36:58,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:58,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:58,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:58,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:58,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:58,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:36:58,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:36:58,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:58,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,755 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. [2020-06-22 09:36:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:58,826 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. [2020-06-22 09:36:58,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:58,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:36:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:36:58,827 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:36:58,827 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:36:58,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:36:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:36:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:36:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-06-22 09:36:58,831 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 5 [2020-06-22 09:36:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:36:58,831 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-06-22 09:36:58,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:36:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-06-22 09:36:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:36:58,832 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:36:58,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:36:58,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 09:36:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash 115665046, now seen corresponding path program 1 times [2020-06-22 09:36:58,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:58,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:58,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:36:58,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:36:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,864 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. [2020-06-22 09:36:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:58,911 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2020-06-22 09:36:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:58,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:36:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:36:58,913 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:36:58,913 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:36:58,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:36:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:36:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:36:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2020-06-22 09:36:58,917 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 5 [2020-06-22 09:36:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:36:58,917 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2020-06-22 09:36:58,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:36:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2020-06-22 09:36:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:36:58,917 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:36:58,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:36:58,918 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-06-22 09:36:58,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash 115665047, now seen corresponding path program 1 times [2020-06-22 09:36:58,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:58,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:58,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:58,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:36:58,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:36:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:58,950 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 3 states. [2020-06-22 09:36:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:59,001 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2020-06-22 09:36:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:59,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:36:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:36:59,002 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:36:59,002 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:36:59,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:36:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:36:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:36:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:36:59,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 09:36:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:36:59,004 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:36:59,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:36:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:36:59,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:36:59,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:36:59,045 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:36:59,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:36:59,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:36:59,046 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:36:59,046 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:36:59,047 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,048 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,048 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,048 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:36:59,048 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:36:59,048 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:36:59,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:36:59,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:36:59,050 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 09:36:59,050 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-06-22 09:36:59,050 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-06-22 09:36:59,050 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:36:59,050 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2020-06-22 09:36:59,050 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 09:36:59,050 INFO L448 ceAbstractionStarter]: For program point L14-6(lines 14 17) no Hoare annotation was computed. [2020-06-22 09:36:59,051 INFO L444 ceAbstractionStarter]: At program point L14-8(lines 14 17) the Hoare annotation is: (and (= 0 ULTIMATE.start_quot_~x_ref~0.offset) (= ULTIMATE.start_quot_~i~0.offset 0) (= (select |#length| ULTIMATE.start_quot_~x_ref~0.base) 4) (= (select |#valid| ULTIMATE.start_quot_~x_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_quot_~i~0.base)) (= (select |#length| ULTIMATE.start_quot_~i~0.base) 4) (= 4 (select |#length| ULTIMATE.start_quot_~y_ref~0.base)) (= ULTIMATE.start_quot_~y_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_quot_~y_ref~0.base) 1)) [2020-06-22 09:36:59,051 INFO L448 ceAbstractionStarter]: For program point L14-9(lines 14 17) no Hoare annotation was computed. [2020-06-22 09:36:59,051 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:36:59,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:36:59,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:36:59,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:36:59,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:36:59,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:36:59,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:36:59,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:36:59 BasicIcfg [2020-06-22 09:36:59,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:36:59,071 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:36:59,071 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:36:59,074 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:36:59,075 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:36:59,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:36:56" (1/5) ... [2020-06-22 09:36:59,075 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d89e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:36:59, skipping insertion in model container [2020-06-22 09:36:59,075 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:36:59,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:36:56" (2/5) ... [2020-06-22 09:36:59,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d89e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:36:59, skipping insertion in model container [2020-06-22 09:36:59,076 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:36:59,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:36:57" (3/5) ... [2020-06-22 09:36:59,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d89e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:36:59, skipping insertion in model container [2020-06-22 09:36:59,077 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:36:59,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:36:57" (4/5) ... [2020-06-22 09:36:59,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d89e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:36:59, skipping insertion in model container [2020-06-22 09:36:59,077 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:36:59,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:36:59" (5/5) ... [2020-06-22 09:36:59,079 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:36:59,099 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:36:59,100 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:36:59,100 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:36:59,100 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:36:59,100 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:36:59,100 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:36:59,100 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:36:59,100 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:36:59,100 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:36:59,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-06-22 09:36:59,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:36:59,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:36:59,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:36:59,115 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,115 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,115 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:36:59,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-06-22 09:36:59,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:36:59,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:36:59,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:36:59,119 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,119 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,124 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (> |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 14#L10true [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 35#L10-1true [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 39#L11true [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 19#L12true [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 42#L13true [178] L13-->L14-8: Formula: (< |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 30#L14-8true [2020-06-22 09:36:59,125 INFO L796 eck$LassoCheckResult]: Loop: 30#L14-8true [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 23#L14-1true [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 21#L14-2true [83] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_quot_#t~short6_5|) InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} AuxVars[] AssignedVars[] 33#L14-6true [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 26#L15true [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 44#L15-1true [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 5#L16true [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 3#L16-1true [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 25#L16-2true [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 30#L14-8true [2020-06-22 09:36:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash -543744080, now seen corresponding path program 1 times [2020-06-22 09:36:59,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1733919629, now seen corresponding path program 1 times [2020-06-22 09:36:59,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:59,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:59,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:36:59,192 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:36:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:59,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:59,194 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-06-22 09:36:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:59,314 INFO L93 Difference]: Finished difference Result 45 states and 80 transitions. [2020-06-22 09:36:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:59,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 80 transitions. [2020-06-22 09:36:59,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 09:36:59,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 20 states and 31 transitions. [2020-06-22 09:36:59,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 09:36:59,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 09:36:59,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2020-06-22 09:36:59,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:36:59,323 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 09:36:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2020-06-22 09:36:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 09:36:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:36:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2020-06-22 09:36:59,326 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-06-22 09:36:59,326 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-06-22 09:36:59,326 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:36:59,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. [2020-06-22 09:36:59,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 09:36:59,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:36:59,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:36:59,329 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,329 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,330 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 107#L-1 [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (> |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 108#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 105#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 106#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 112#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 114#L13 [178] L13-->L14-8: Formula: (< |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 102#L14-8 [2020-06-22 09:36:59,331 INFO L796 eck$LassoCheckResult]: Loop: 102#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 103#L14-1 [188] L14-1-->L14-2: Formula: (and (>= 0 |v_ULTIMATE.start_quot_#t~mem4_3|) (not |v_ULTIMATE.start_quot_#t~short6_2|)) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 115#L14-2 [83] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_quot_#t~short6_5|) InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} AuxVars[] AssignedVars[] 104#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 97#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 98#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 101#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 99#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 100#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 102#L14-8 [2020-06-22 09:36:59,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,331 INFO L82 PathProgramCache]: Analyzing trace with hash -543744080, now seen corresponding path program 2 times [2020-06-22 09:36:59,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:59,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,358 INFO L82 PathProgramCache]: Analyzing trace with hash -818237332, now seen corresponding path program 1 times [2020-06-22 09:36:59,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:36:59,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:59,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:59,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:36:59,369 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:36:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:36:59,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:36:59,370 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 09:36:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:59,405 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2020-06-22 09:36:59,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:36:59,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2020-06-22 09:36:59,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:36:59,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 26 transitions. [2020-06-22 09:36:59,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 09:36:59,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 09:36:59,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-06-22 09:36:59,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:36:59,408 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-06-22 09:36:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-06-22 09:36:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:36:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:36:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-06-22 09:36:59,410 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-06-22 09:36:59,410 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-06-22 09:36:59,410 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:36:59,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2020-06-22 09:36:59,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:36:59,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:36:59,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:36:59,412 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,412 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,412 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 152#L-1 [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (> |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 153#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 150#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 151#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 157#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 159#L13 [178] L13-->L14-8: Formula: (< |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 147#L14-8 [2020-06-22 09:36:59,413 INFO L796 eck$LassoCheckResult]: Loop: 147#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 148#L14-1 [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 158#L14-2 [82] L14-2-->L14-3: Formula: |v_ULTIMATE.start_quot_#t~short6_3| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} AuxVars[] AssignedVars[] 156#L14-3 [79] L14-3-->L14-4: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_quot_~y_ref~0.base_6) v_ULTIMATE.start_quot_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_quot_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_quot_~y_ref~0.base_6))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_2|, #valid=|v_#valid_21|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem5] 154#L14-4 [193] L14-4-->L14-6: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem5_3|) |v_ULTIMATE.start_quot_#t~short6_4|) InVars {ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_4|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 149#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 142#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 143#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 146#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 144#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 145#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 147#L14-8 [2020-06-22 09:36:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash -543744080, now seen corresponding path program 3 times [2020-06-22 09:36:59,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:59,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1707090210, now seen corresponding path program 1 times [2020-06-22 09:36:59,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:36:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1413518385, now seen corresponding path program 1 times [2020-06-22 09:36:59,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:59,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:36:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:36:59,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:36:59,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:36:59,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:36:59,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:36:59,656 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-06-22 09:36:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:36:59,728 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2020-06-22 09:36:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:36:59,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2020-06-22 09:36:59,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:36:59,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 25 transitions. [2020-06-22 09:36:59,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 09:36:59,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 09:36:59,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-06-22 09:36:59,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:36:59,730 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-06-22 09:36:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-06-22 09:36:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:36:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:36:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-06-22 09:36:59,732 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-06-22 09:36:59,732 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-06-22 09:36:59,732 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:36:59,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-06-22 09:36:59,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:36:59,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:36:59,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:36:59,734 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,734 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:36:59,735 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 202#L-1 [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (> |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 203#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 200#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 201#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 206#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 208#L13 [177] L13-->L14-8: Formula: (> |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 197#L14-8 [2020-06-22 09:36:59,735 INFO L796 eck$LassoCheckResult]: Loop: 197#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 198#L14-1 [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 209#L14-2 [82] L14-2-->L14-3: Formula: |v_ULTIMATE.start_quot_#t~short6_3| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} AuxVars[] AssignedVars[] 207#L14-3 [79] L14-3-->L14-4: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_quot_~y_ref~0.base_6) v_ULTIMATE.start_quot_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_quot_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_quot_~y_ref~0.base_6))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_2|, #valid=|v_#valid_21|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem5] 204#L14-4 [193] L14-4-->L14-6: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem5_3|) |v_ULTIMATE.start_quot_#t~short6_4|) InVars {ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_4|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 199#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 192#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 193#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 196#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 194#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 195#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 197#L14-8 [2020-06-22 09:36:59,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -543744081, now seen corresponding path program 1 times [2020-06-22 09:36:59,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1707090210, now seen corresponding path program 2 times [2020-06-22 09:36:59,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:36:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:36:59,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1542601104, now seen corresponding path program 1 times [2020-06-22 09:36:59,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:36:59,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:36:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:36:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:36:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:36:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:00,329 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2020-06-22 09:37:00,517 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-06-22 09:37:00,530 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:37:00,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:37:00,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:37:00,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:37:00,532 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:37:00,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:37:00,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:37:00,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:37:00,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:37:00,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:37:00,533 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:37:00,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:00,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:00,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:00,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:00,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:00,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:00,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:00,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:00,911 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2020-06-22 09:37:01,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:01,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:01,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:01,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:01,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:01,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:01,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:01,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:37:01,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:37:01,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:01,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:01,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:01,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:01,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:01,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:01,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:01,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:01,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:01,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:01,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:01,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:01,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:01,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:01,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:01,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:01,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:01,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:01,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:01,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:01,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:01,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:01,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:01,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:01,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:01,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:01,592 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:37:01,604 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:37:01,604 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:37:01,606 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:37:01,608 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:37:01,608 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:37:01,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1 Supporting invariants [] [2020-06-22 09:37:01,699 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:37:01,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:37:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:01,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:37:01,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:01,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:37:01,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:01,957 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:01,958 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 86 [2020-06-22 09:37:01,974 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:02,075 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2020-06-22 09:37:02,076 INFO L497 ElimStorePlain]: treesize reduction 88, result has 38.5 percent of original size [2020-06-22 09:37:02,077 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:37:02,077 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 [2020-06-22 09:37:07,344 WARN L188 SmtUtils]: Spent 3.43 s on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 09:37:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:37:09,335 WARN L860 $PredicateComparison]: unable to prove that (or (<= 2 (select (select |c_#memory_int| c_ULTIMATE.start_quot_~i~0.base) c_ULTIMATE.start_quot_~y_ref~0.offset)) (exists ((ULTIMATE.start_quot_~i~0.offset Int)) (not (and (= c_ULTIMATE.start_quot_~y_ref~0.base c_ULTIMATE.start_quot_~i~0.base) (= ULTIMATE.start_quot_~i~0.offset c_ULTIMATE.start_quot_~y_ref~0.offset))))) is different from true [2020-06-22 09:37:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:09,443 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:09,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:37:09,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:09,463 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 09:37:09,464 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:09,471 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:09,472 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:09,472 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 09:37:09,575 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:09,576 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 [2020-06-22 09:37:09,582 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:09,653 INFO L497 ElimStorePlain]: treesize reduction 49, result has 51.0 percent of original size [2020-06-22 09:37:09,654 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:09,655 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 [2020-06-22 09:37:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:10,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:37:10,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:10,400 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:10,400 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 [2020-06-22 09:37:10,407 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:10,502 INFO L497 ElimStorePlain]: treesize reduction 49, result has 51.0 percent of original size [2020-06-22 09:37:10,504 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:10,504 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 [2020-06-22 09:37:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:10,584 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:10,594 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:10,594 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 22 predicates after loop cannibalization [2020-06-22 09:37:10,598 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 22 loop predicates [2020-06-22 09:37:10,599 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-06-22 09:37:22,680 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 25 transitions. cyclomatic complexity: 8. Second operand 11 states. Result 232 states and 243 transitions. Complement of second has 172 states. [2020-06-22 09:37:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 47 states 4 stem states 39 non-accepting loop states 4 accepting loop states [2020-06-22 09:37:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:37:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 131 transitions. [2020-06-22 09:37:22,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 131 transitions. Stem has 7 letters. Loop has 11 letters. [2020-06-22 09:37:22,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:22,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 131 transitions. Stem has 18 letters. Loop has 11 letters. [2020-06-22 09:37:22,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:22,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 131 transitions. Stem has 7 letters. Loop has 22 letters. [2020-06-22 09:37:22,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:22,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 243 transitions. [2020-06-22 09:37:22,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2020-06-22 09:37:22,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 98 states and 103 transitions. [2020-06-22 09:37:22,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2020-06-22 09:37:22,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2020-06-22 09:37:22,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 103 transitions. [2020-06-22 09:37:22,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:37:22,702 INFO L706 BuchiCegarLoop]: Abstraction has 98 states and 103 transitions. [2020-06-22 09:37:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 103 transitions. [2020-06-22 09:37:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 18. [2020-06-22 09:37:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:37:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-06-22 09:37:22,705 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-06-22 09:37:22,705 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-06-22 09:37:22,705 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:37:22,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-06-22 09:37:22,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:37:22,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:37:22,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:37:22,707 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:22,707 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:22,707 INFO L794 eck$LassoCheckResult]: Stem: 987#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 984#L-1 [158] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (< 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 985#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 982#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 983#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 989#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 991#L13 [177] L13-->L14-8: Formula: (> |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 979#L14-8 [2020-06-22 09:37:22,708 INFO L796 eck$LassoCheckResult]: Loop: 979#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 980#L14-1 [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 990#L14-2 [82] L14-2-->L14-3: Formula: |v_ULTIMATE.start_quot_#t~short6_3| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} AuxVars[] AssignedVars[] 988#L14-3 [79] L14-3-->L14-4: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_quot_~y_ref~0.base_6) v_ULTIMATE.start_quot_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_quot_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_quot_~y_ref~0.base_6))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_2|, #valid=|v_#valid_21|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem5] 986#L14-4 [193] L14-4-->L14-6: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem5_3|) |v_ULTIMATE.start_quot_#t~short6_4|) InVars {ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_4|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 981#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 974#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 975#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 978#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 976#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 977#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 979#L14-8 [2020-06-22 09:37:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:22,708 INFO L82 PathProgramCache]: Analyzing trace with hash -572373232, now seen corresponding path program 1 times [2020-06-22 09:37:22,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:22,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:22,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1707090210, now seen corresponding path program 3 times [2020-06-22 09:37:22,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:22,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1399056495, now seen corresponding path program 1 times [2020-06-22 09:37:22,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:22,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:37:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:23,267 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2020-06-22 09:37:23,438 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-06-22 09:37:23,441 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:37:23,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:37:23,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:37:23,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:37:23,441 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:37:23,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:37:23,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:37:23,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:37:23,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 09:37:23,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:37:23,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:37:23,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,807 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-06-22 09:37:23,921 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-06-22 09:37:23,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:23,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:24,369 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:37:24,369 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:37:24,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:24,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:24,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:24,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:24,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:24,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:24,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:24,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:24,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:24,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:24,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:24,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:24,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:24,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:24,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:24,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:24,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:24,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:24,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:24,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:24,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:24,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:24,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:24,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:24,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:24,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:24,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:24,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:24,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:24,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:24,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:24,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:24,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:24,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:24,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:24,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:37:24,425 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:37:24,425 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:37:24,426 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:37:24,427 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:37:24,427 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:37:24,427 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_2 Supporting invariants [] [2020-06-22 09:37:24,505 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:37:24,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:37:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:24,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:37:24,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:24,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:37:24,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:24,754 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:24,755 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 86 [2020-06-22 09:37:24,764 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:24,898 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2020-06-22 09:37:24,898 INFO L497 ElimStorePlain]: treesize reduction 94, result has 36.9 percent of original size [2020-06-22 09:37:24,900 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:37:24,900 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 [2020-06-22 09:37:30,270 WARN L188 SmtUtils]: Spent 3.50 s on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 09:37:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:37:32,254 WARN L860 $PredicateComparison]: unable to prove that (or (<= 2 (select (select |c_#memory_int| c_ULTIMATE.start_quot_~i~0.base) c_ULTIMATE.start_quot_~y_ref~0.offset)) (exists ((ULTIMATE.start_quot_~i~0.offset Int)) (not (and (= c_ULTIMATE.start_quot_~y_ref~0.base c_ULTIMATE.start_quot_~i~0.base) (= ULTIMATE.start_quot_~i~0.offset c_ULTIMATE.start_quot_~y_ref~0.offset))))) is different from true [2020-06-22 09:37:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:32,353 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:32,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:37:32,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:32,369 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 09:37:32,370 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:32,376 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:32,377 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:32,377 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 09:37:32,478 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:32,479 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 [2020-06-22 09:37:32,483 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:32,544 INFO L497 ElimStorePlain]: treesize reduction 49, result has 51.0 percent of original size [2020-06-22 09:37:32,545 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:32,545 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 [2020-06-22 09:37:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:33,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:37:33,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:33,286 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:33,287 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 [2020-06-22 09:37:33,291 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:33,349 INFO L497 ElimStorePlain]: treesize reduction 49, result has 51.0 percent of original size [2020-06-22 09:37:33,350 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:33,350 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 [2020-06-22 09:37:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:33,438 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:33,448 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:33,448 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 22 predicates after loop cannibalization [2020-06-22 09:37:33,448 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 22 loop predicates [2020-06-22 09:37:33,448 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 23 transitions. cyclomatic complexity: 6 Second operand 11 states. [2020-06-22 09:37:45,750 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 23 transitions. cyclomatic complexity: 6. Second operand 11 states. Result 174 states and 182 transitions. Complement of second has 129 states. [2020-06-22 09:37:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 47 states 4 stem states 39 non-accepting loop states 4 accepting loop states [2020-06-22 09:37:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:37:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 112 transitions. [2020-06-22 09:37:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 112 transitions. Stem has 7 letters. Loop has 11 letters. [2020-06-22 09:37:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 112 transitions. Stem has 18 letters. Loop has 11 letters. [2020-06-22 09:37:45,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:45,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 112 transitions. Stem has 7 letters. Loop has 22 letters. [2020-06-22 09:37:45,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:45,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 182 transitions. [2020-06-22 09:37:45,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 09:37:45,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 66 states and 69 transitions. [2020-06-22 09:37:45,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-06-22 09:37:45,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2020-06-22 09:37:45,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 69 transitions. [2020-06-22 09:37:45,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:37:45,764 INFO L706 BuchiCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-06-22 09:37:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 69 transitions. [2020-06-22 09:37:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 18. [2020-06-22 09:37:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:37:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2020-06-22 09:37:45,767 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-06-22 09:37:45,767 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-06-22 09:37:45,767 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 09:37:45,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2020-06-22 09:37:45,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:37:45,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:37:45,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:37:45,768 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:45,768 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:45,769 INFO L794 eck$LassoCheckResult]: Stem: 1668#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1665#L-1 [157] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 1666#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1663#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 1664#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1670#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 1672#L13 [177] L13-->L14-8: Formula: (> |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 1660#L14-8 [2020-06-22 09:37:45,769 INFO L796 eck$LassoCheckResult]: Loop: 1660#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 1661#L14-1 [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 1671#L14-2 [82] L14-2-->L14-3: Formula: |v_ULTIMATE.start_quot_#t~short6_3| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} AuxVars[] AssignedVars[] 1669#L14-3 [79] L14-3-->L14-4: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_quot_~y_ref~0.base_6) v_ULTIMATE.start_quot_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_quot_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_quot_~y_ref~0.base_6))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_2|, #valid=|v_#valid_21|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem5] 1667#L14-4 [193] L14-4-->L14-6: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem5_3|) |v_ULTIMATE.start_quot_#t~short6_4|) InVars {ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_4|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 1662#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 1657#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 1658#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 1659#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 1655#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 1656#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 1660#L14-8 [2020-06-22 09:37:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash -601002383, now seen corresponding path program 1 times [2020-06-22 09:37:45,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:45,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:45,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1707090210, now seen corresponding path program 4 times [2020-06-22 09:37:45,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:45,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:45,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash 45746798, now seen corresponding path program 1 times [2020-06-22 09:37:45,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:45,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:45,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:45,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:37:45,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:46,237 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2020-06-22 09:37:46,405 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-06-22 09:37:46,409 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:37:46,409 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:37:46,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:37:46,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:37:46,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:37:46,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:37:46,410 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:37:46,410 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:37:46,410 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 09:37:46,410 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:37:46,410 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:37:46,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,711 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-06-22 09:37:46,828 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-06-22 09:37:46,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:46,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:37:47,216 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:37:47,216 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:37:47,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:47,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:47,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:47,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:47,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:47,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:47,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:47,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:47,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:47,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:47,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:47,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:47,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:47,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:47,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:47,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:47,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:47,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:47,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:47,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:47,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:47,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:47,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:47,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:47,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:47,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:47,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:47,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:47,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:47,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:47,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:47,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:47,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:47,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:47,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:47,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:47,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:47,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:47,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:47,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:47,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:47,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:47,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:47,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:37:47,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:47,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:47,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:47,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:47,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:47,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:47,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:37:47,256 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:37:47,256 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:37:47,257 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:37:47,258 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:37:47,258 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:37:47,258 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_3 Supporting invariants [] [2020-06-22 09:37:47,339 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:37:47,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:37:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:47,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 09:37:47,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:47,394 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 09:37:47,394 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:47,399 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:47,400 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:47,400 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-06-22 09:37:47,418 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:47,419 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-06-22 09:37:47,420 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:37:47,425 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:47,425 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:47,425 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 [2020-06-22 09:37:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:47,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:37:47,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:47,578 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:47,579 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 86 [2020-06-22 09:37:47,586 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:47,654 INFO L497 ElimStorePlain]: treesize reduction 96, result has 36.4 percent of original size [2020-06-22 09:37:47,655 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:37:47,655 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 [2020-06-22 09:37:53,034 WARN L188 SmtUtils]: Spent 3.51 s on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 09:37:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:37:55,062 WARN L860 $PredicateComparison]: unable to prove that (or (<= 2 (select (select |c_#memory_int| c_ULTIMATE.start_quot_~i~0.base) c_ULTIMATE.start_quot_~y_ref~0.offset)) (exists ((ULTIMATE.start_quot_~i~0.offset Int)) (not (and (= c_ULTIMATE.start_quot_~y_ref~0.base c_ULTIMATE.start_quot_~i~0.base) (= ULTIMATE.start_quot_~i~0.offset c_ULTIMATE.start_quot_~y_ref~0.offset))))) is different from true [2020-06-22 09:37:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:55,170 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:55,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:37:55,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:55,185 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 09:37:55,185 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:55,191 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:55,192 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:55,192 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 09:37:55,279 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:55,280 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 [2020-06-22 09:37:55,283 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:55,335 INFO L497 ElimStorePlain]: treesize reduction 50, result has 49.5 percent of original size [2020-06-22 09:37:55,336 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:55,336 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 [2020-06-22 09:37:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:56,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:37:56,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:56,181 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:56,181 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 [2020-06-22 09:37:56,184 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:56,251 INFO L497 ElimStorePlain]: treesize reduction 50, result has 49.5 percent of original size [2020-06-22 09:37:56,252 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:56,252 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 [2020-06-22 09:37:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:56,338 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:56,348 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:56,348 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 22 predicates after loop cannibalization [2020-06-22 09:37:56,348 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 22 loop predicates [2020-06-22 09:37:56,348 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 21 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-06-22 09:38:05,898 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 21 transitions. cyclomatic complexity: 4. Second operand 13 states. Result 58 states and 62 transitions. Complement of second has 44 states. [2020-06-22 09:38:05,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 3 stem states 18 non-accepting loop states 3 accepting loop states [2020-06-22 09:38:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 09:38:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 57 transitions. [2020-06-22 09:38:05,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 57 transitions. Stem has 7 letters. Loop has 11 letters. [2020-06-22 09:38:05,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:38:05,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 57 transitions. Stem has 18 letters. Loop has 11 letters. [2020-06-22 09:38:05,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:38:05,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 57 transitions. Stem has 7 letters. Loop has 22 letters. [2020-06-22 09:38:05,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:38:05,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2020-06-22 09:38:05,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:38:05,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2020-06-22 09:38:05,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:38:05,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:38:05,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:38:05,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:38:05,908 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:38:05,908 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:38:05,908 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:38:05,908 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 09:38:05,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:38:05,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:38:05,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:38:05,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:38:05 BasicIcfg [2020-06-22 09:38:05,917 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:38:05,917 INFO L168 Benchmark]: Toolchain (without parser) took 69275.23 ms. Allocated memory was 649.6 MB in the beginning and 950.5 MB in the end (delta: 300.9 MB). Free memory was 565.3 MB in the beginning and 562.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 303.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:38:05,919 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:38:05,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.65 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 565.3 MB in the beginning and 648.3 MB in the end (delta: -82.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:38:05,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.77 ms. Allocated memory is still 684.2 MB. Free memory was 647.2 MB in the beginning and 646.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:38:05,921 INFO L168 Benchmark]: Boogie Preprocessor took 24.90 ms. Allocated memory is still 684.2 MB. Free memory was 646.1 MB in the beginning and 643.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:38:05,921 INFO L168 Benchmark]: RCFGBuilder took 415.93 ms. Allocated memory is still 684.2 MB. Free memory was 643.9 MB in the beginning and 617.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:38:05,922 INFO L168 Benchmark]: BlockEncodingV2 took 129.48 ms. Allocated memory is still 684.2 MB. Free memory was 617.4 MB in the beginning and 607.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:38:05,922 INFO L168 Benchmark]: TraceAbstraction took 1509.18 ms. Allocated memory is still 684.2 MB. Free memory was 607.7 MB in the beginning and 439.3 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:38:05,923 INFO L168 Benchmark]: BuchiAutomizer took 66846.26 ms. Allocated memory was 684.2 MB in the beginning and 950.5 MB in the end (delta: 266.3 MB). Free memory was 439.3 MB in the beginning and 562.5 MB in the end (delta: -123.2 MB). Peak memory consumption was 143.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:38:05,926 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 50 locations, 53 edges - StatisticsResult: Encoded RCFG 43 locations, 78 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 301.65 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 565.3 MB in the beginning and 648.3 MB in the end (delta: -82.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.77 ms. Allocated memory is still 684.2 MB. Free memory was 647.2 MB in the beginning and 646.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.90 ms. Allocated memory is still 684.2 MB. Free memory was 646.1 MB in the beginning and 643.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 415.93 ms. Allocated memory is still 684.2 MB. Free memory was 643.9 MB in the beginning and 617.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 129.48 ms. Allocated memory is still 684.2 MB. Free memory was 617.4 MB in the beginning and 607.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1509.18 ms. Allocated memory is still 684.2 MB. Free memory was 607.7 MB in the beginning and 439.3 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 66846.26 ms. Allocated memory was 684.2 MB in the beginning and 950.5 MB in the end (delta: 266.3 MB). Free memory was 439.3 MB in the beginning and 562.5 MB in the end (delta: -123.2 MB). Peak memory consumption was 143.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 09:38:05,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:38:05,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:38:05,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:38:05,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:38:05,937 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:38:05,937 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((0 == x_ref && i == 0) && unknown-#length-unknown[x_ref] == 4) && \valid[x_ref] == 1) && 1 == \valid[i]) && unknown-#length-unknown[i] == 4) && 4 == unknown-#length-unknown[y_ref]) && y_ref == 0) && \valid[y_ref] == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 24 error locations. SAFE Result, 1.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 294 SDslu, 5 SDs, 0 SdLazy, 322 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 47 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 47 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 24 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 66.8s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 1.7s. Büchi inclusion checks took 59.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 129 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 121 SDtfs, 457 SDslu, 516 SDs, 0 SdLazy, 1982 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital340 mio100 ax100 hnf100 lsp97 ukn56 mio100 lsp38 div100 bol100 ite100 ukn100 eq186 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:36:53.421 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:38:06.162 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check