121.54/79.32 YES 121.54/79.32 121.54/79.32 Ultimate: Cannot open display: 121.54/79.32 This is Ultimate 0.1.24-8dc7c08-m 121.54/79.32 [2019-03-28 12:45:15,629 INFO L170 SettingsManager]: Resetting all preferences to default values... 121.54/79.32 [2019-03-28 12:45:15,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 121.54/79.32 [2019-03-28 12:45:15,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 121.54/79.32 [2019-03-28 12:45:15,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 121.54/79.32 [2019-03-28 12:45:15,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 121.54/79.32 [2019-03-28 12:45:15,646 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 121.54/79.32 [2019-03-28 12:45:15,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 121.54/79.32 [2019-03-28 12:45:15,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 121.54/79.32 [2019-03-28 12:45:15,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 121.54/79.32 [2019-03-28 12:45:15,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 121.54/79.32 [2019-03-28 12:45:15,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 121.54/79.32 [2019-03-28 12:45:15,651 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 121.54/79.32 [2019-03-28 12:45:15,652 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 121.54/79.32 [2019-03-28 12:45:15,653 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 121.54/79.32 [2019-03-28 12:45:15,654 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 121.54/79.32 [2019-03-28 12:45:15,655 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 121.54/79.32 [2019-03-28 12:45:15,657 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 121.54/79.32 [2019-03-28 12:45:15,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 121.54/79.32 [2019-03-28 12:45:15,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 121.54/79.32 [2019-03-28 12:45:15,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 121.54/79.32 [2019-03-28 12:45:15,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 121.54/79.32 [2019-03-28 12:45:15,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 121.54/79.32 [2019-03-28 12:45:15,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 121.54/79.32 [2019-03-28 12:45:15,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 121.54/79.32 [2019-03-28 12:45:15,666 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 121.54/79.32 [2019-03-28 12:45:15,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 121.54/79.32 [2019-03-28 12:45:15,667 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 121.54/79.32 [2019-03-28 12:45:15,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 121.54/79.32 [2019-03-28 12:45:15,668 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 121.54/79.32 [2019-03-28 12:45:15,669 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 121.54/79.32 [2019-03-28 12:45:15,670 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 121.54/79.32 [2019-03-28 12:45:15,671 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 121.54/79.32 [2019-03-28 12:45:15,671 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 121.54/79.32 [2019-03-28 12:45:15,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 121.54/79.32 [2019-03-28 12:45:15,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 121.54/79.32 [2019-03-28 12:45:15,672 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 121.54/79.32 [2019-03-28 12:45:15,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 121.54/79.32 [2019-03-28 12:45:15,673 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 121.54/79.32 [2019-03-28 12:45:15,674 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 121.54/79.32 [2019-03-28 12:45:15,688 INFO L110 SettingsManager]: Loading preferences was successful 121.54/79.32 [2019-03-28 12:45:15,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 121.54/79.32 [2019-03-28 12:45:15,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 121.54/79.32 [2019-03-28 12:45:15,690 INFO L133 SettingsManager]: * Rewrite not-equals=true 121.54/79.32 [2019-03-28 12:45:15,690 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 121.54/79.32 [2019-03-28 12:45:15,690 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 121.54/79.32 [2019-03-28 12:45:15,691 INFO L133 SettingsManager]: * Use SBE=true 121.54/79.32 [2019-03-28 12:45:15,691 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 121.54/79.32 [2019-03-28 12:45:15,691 INFO L133 SettingsManager]: * Use old map elimination=false 121.54/79.32 [2019-03-28 12:45:15,691 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 121.54/79.32 [2019-03-28 12:45:15,691 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 121.54/79.32 [2019-03-28 12:45:15,692 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 121.54/79.32 [2019-03-28 12:45:15,692 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 121.54/79.32 [2019-03-28 12:45:15,692 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 121.54/79.32 [2019-03-28 12:45:15,692 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 121.54/79.32 [2019-03-28 12:45:15,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 121.54/79.32 [2019-03-28 12:45:15,693 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 121.54/79.32 [2019-03-28 12:45:15,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE 121.54/79.32 [2019-03-28 12:45:15,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 121.54/79.32 [2019-03-28 12:45:15,693 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 121.54/79.32 [2019-03-28 12:45:15,693 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 121.54/79.32 [2019-03-28 12:45:15,694 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 121.54/79.32 [2019-03-28 12:45:15,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 121.54/79.32 [2019-03-28 12:45:15,694 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 121.54/79.32 [2019-03-28 12:45:15,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 121.54/79.32 [2019-03-28 12:45:15,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 121.54/79.32 [2019-03-28 12:45:15,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 121.54/79.32 [2019-03-28 12:45:15,695 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 121.54/79.32 [2019-03-28 12:45:15,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 121.54/79.32 [2019-03-28 12:45:15,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 121.54/79.32 [2019-03-28 12:45:15,734 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 121.54/79.32 [2019-03-28 12:45:15,738 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 121.54/79.32 [2019-03-28 12:45:15,739 INFO L271 PluginConnector]: Initializing CDTParser... 121.54/79.32 [2019-03-28 12:45:15,740 INFO L276 PluginConnector]: CDTParser initialized 121.54/79.32 [2019-03-28 12:45:15,740 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 121.54/79.32 [2019-03-28 12:45:15,808 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/4d45f5b0f3c3494992e81c985124e570/FLAGa5ae5000d 121.54/79.32 [2019-03-28 12:45:16,152 INFO L307 CDTParser]: Found 1 translation units. 121.54/79.32 [2019-03-28 12:45:16,153 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 121.54/79.32 [2019-03-28 12:45:16,154 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 121.54/79.32 [2019-03-28 12:45:16,160 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/4d45f5b0f3c3494992e81c985124e570/FLAGa5ae5000d 121.54/79.32 [2019-03-28 12:45:16,549 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/4d45f5b0f3c3494992e81c985124e570 121.54/79.32 [2019-03-28 12:45:16,561 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 121.54/79.32 [2019-03-28 12:45:16,563 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 121.54/79.32 [2019-03-28 12:45:16,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 121.54/79.32 [2019-03-28 12:45:16,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 121.54/79.32 [2019-03-28 12:45:16,567 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 121.54/79.32 [2019-03-28 12:45:16,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bf95b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16, skipping insertion in model container 121.54/79.32 [2019-03-28 12:45:16,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 121.54/79.32 [2019-03-28 12:45:16,597 INFO L176 MainTranslator]: Built tables and reachable declarations 121.54/79.32 [2019-03-28 12:45:16,762 INFO L206 PostProcessor]: Analyzing one entry point: main 121.54/79.32 [2019-03-28 12:45:16,775 INFO L191 MainTranslator]: Completed pre-run 121.54/79.32 [2019-03-28 12:45:16,794 INFO L206 PostProcessor]: Analyzing one entry point: main 121.54/79.32 [2019-03-28 12:45:16,875 INFO L195 MainTranslator]: Completed translation 121.54/79.32 [2019-03-28 12:45:16,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16 WrapperNode 121.54/79.32 [2019-03-28 12:45:16,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 121.54/79.32 [2019-03-28 12:45:16,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 121.54/79.32 [2019-03-28 12:45:16,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 121.54/79.32 [2019-03-28 12:45:16,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 121.54/79.32 [2019-03-28 12:45:16,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 121.54/79.32 [2019-03-28 12:45:16,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 121.54/79.32 [2019-03-28 12:45:16,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 121.54/79.32 [2019-03-28 12:45:16,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized 121.54/79.32 [2019-03-28 12:45:16,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 [2019-03-28 12:45:16,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 121.54/79.32 [2019-03-28 12:45:16,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 121.54/79.32 [2019-03-28 12:45:16,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... 121.54/79.32 [2019-03-28 12:45:16,947 INFO L276 PluginConnector]: RCFGBuilder initialized 121.54/79.32 [2019-03-28 12:45:16,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 121.54/79.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 121.54/79.32 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 121.54/79.32 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 121.54/79.32 [2019-03-28 12:45:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 121.54/79.32 [2019-03-28 12:45:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 121.54/79.32 [2019-03-28 12:45:17,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 121.54/79.32 [2019-03-28 12:45:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 121.54/79.32 [2019-03-28 12:45:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 121.54/79.32 [2019-03-28 12:45:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 121.54/79.32 [2019-03-28 12:45:17,316 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 121.54/79.32 [2019-03-28 12:45:17,316 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 121.54/79.32 [2019-03-28 12:45:17,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:17 BoogieIcfgContainer 121.54/79.32 [2019-03-28 12:45:17,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 121.54/79.32 [2019-03-28 12:45:17,319 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 121.54/79.32 [2019-03-28 12:45:17,319 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 121.54/79.32 [2019-03-28 12:45:17,321 INFO L276 PluginConnector]: BlockEncodingV2 initialized 121.54/79.32 [2019-03-28 12:45:17,322 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:17" (1/1) ... 121.54/79.32 [2019-03-28 12:45:17,340 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 56 edges 121.54/79.32 [2019-03-28 12:45:17,341 INFO L258 BlockEncoder]: Using Remove infeasible edges 121.54/79.32 [2019-03-28 12:45:17,342 INFO L263 BlockEncoder]: Using Maximize final states 121.54/79.32 [2019-03-28 12:45:17,343 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 121.54/79.32 [2019-03-28 12:45:17,343 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 121.54/79.32 [2019-03-28 12:45:17,345 INFO L296 BlockEncoder]: Using Remove sink states 121.54/79.32 [2019-03-28 12:45:17,346 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 121.54/79.32 [2019-03-28 12:45:17,346 INFO L179 BlockEncoder]: Using Rewrite not-equals 121.54/79.32 [2019-03-28 12:45:17,374 INFO L185 BlockEncoder]: Using Use SBE 121.54/79.32 [2019-03-28 12:45:17,414 INFO L200 BlockEncoder]: SBE split 28 edges 121.54/79.32 [2019-03-28 12:45:17,420 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 121.54/79.32 [2019-03-28 12:45:17,422 INFO L71 MaximizeFinalStates]: 0 new accepting states 121.54/79.32 [2019-03-28 12:45:17,471 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 121.54/79.32 [2019-03-28 12:45:17,474 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 121.54/79.32 [2019-03-28 12:45:17,476 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 121.54/79.32 [2019-03-28 12:45:17,476 INFO L71 MaximizeFinalStates]: 0 new accepting states 121.54/79.32 [2019-03-28 12:45:17,476 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 121.54/79.32 [2019-03-28 12:45:17,477 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 121.54/79.32 [2019-03-28 12:45:17,478 INFO L313 BlockEncoder]: Encoded RCFG 43 locations, 80 edges 121.54/79.32 [2019-03-28 12:45:17,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:17 BasicIcfg 121.54/79.32 [2019-03-28 12:45:17,478 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 121.54/79.32 [2019-03-28 12:45:17,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 121.54/79.32 [2019-03-28 12:45:17,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... 121.54/79.32 [2019-03-28 12:45:17,483 INFO L276 PluginConnector]: TraceAbstraction initialized 121.54/79.32 [2019-03-28 12:45:17,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:45:16" (1/4) ... 121.54/79.32 [2019-03-28 12:45:17,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533074ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:17, skipping insertion in model container 121.54/79.32 [2019-03-28 12:45:17,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (2/4) ... 121.54/79.32 [2019-03-28 12:45:17,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533074ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:17, skipping insertion in model container 121.54/79.32 [2019-03-28 12:45:17,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:17" (3/4) ... 121.54/79.32 [2019-03-28 12:45:17,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533074ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:17, skipping insertion in model container 121.54/79.32 [2019-03-28 12:45:17,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:17" (4/4) ... 121.54/79.32 [2019-03-28 12:45:17,487 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 121.54/79.32 [2019-03-28 12:45:17,497 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 121.54/79.32 [2019-03-28 12:45:17,507 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. 121.54/79.32 [2019-03-28 12:45:17,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 22 error locations. 121.54/79.32 [2019-03-28 12:45:17,553 INFO L133 ementStrategyFactory]: Using default assertion order modulation 121.54/79.32 [2019-03-28 12:45:17,554 INFO L382 AbstractCegarLoop]: Interprodecural is true 121.54/79.32 [2019-03-28 12:45:17,554 INFO L383 AbstractCegarLoop]: Hoare is true 121.54/79.32 [2019-03-28 12:45:17,554 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 121.54/79.32 [2019-03-28 12:45:17,555 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 121.54/79.32 [2019-03-28 12:45:17,555 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 121.54/79.32 [2019-03-28 12:45:17,555 INFO L387 AbstractCegarLoop]: Difference is false 121.54/79.32 [2019-03-28 12:45:17,555 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 121.54/79.32 [2019-03-28 12:45:17,555 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 121.54/79.32 [2019-03-28 12:45:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. 121.54/79.32 [2019-03-28 12:45:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 121.54/79.32 [2019-03-28 12:45:17,577 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:17,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 121.54/79.32 [2019-03-28 12:45:17,578 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash 119551, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:17,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:17,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:17,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:17,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:17,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:17,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 121.54/79.32 [2019-03-28 12:45:17,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:17,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:17,798 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:17,986 INFO L93 Difference]: Finished difference Result 43 states and 80 transitions. 121.54/79.32 [2019-03-28 12:45:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:17,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 121.54/79.32 [2019-03-28 12:45:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:18,002 INFO L225 Difference]: With dead ends: 43 121.54/79.32 [2019-03-28 12:45:18,003 INFO L226 Difference]: Without dead ends: 39 121.54/79.32 [2019-03-28 12:45:18,006 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 121.54/79.32 [2019-03-28 12:45:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 121.54/79.32 [2019-03-28 12:45:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. 121.54/79.32 [2019-03-28 12:45:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 121.54/79.32 [2019-03-28 12:45:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 72 transitions. 121.54/79.32 [2019-03-28 12:45:18,049 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 72 transitions. Word has length 3 121.54/79.32 [2019-03-28 12:45:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:18,050 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 72 transitions. 121.54/79.32 [2019-03-28 12:45:18,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. 121.54/79.32 [2019-03-28 12:45:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 121.54/79.32 [2019-03-28 12:45:18,051 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:18,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 121.54/79.32 [2019-03-28 12:45:18,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash 119553, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:18,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:18,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:18,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:18,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:18,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 121.54/79.32 [2019-03-28 12:45:18,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:18,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,098 INFO L87 Difference]: Start difference. First operand 39 states and 72 transitions. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:18,224 INFO L93 Difference]: Finished difference Result 39 states and 72 transitions. 121.54/79.32 [2019-03-28 12:45:18,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 121.54/79.32 [2019-03-28 12:45:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:18,226 INFO L225 Difference]: With dead ends: 39 121.54/79.32 [2019-03-28 12:45:18,226 INFO L226 Difference]: Without dead ends: 35 121.54/79.32 [2019-03-28 12:45:18,227 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 121.54/79.32 [2019-03-28 12:45:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 121.54/79.32 [2019-03-28 12:45:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 121.54/79.32 [2019-03-28 12:45:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 121.54/79.32 [2019-03-28 12:45:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. 121.54/79.32 [2019-03-28 12:45:18,233 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 64 transitions. Word has length 3 121.54/79.32 [2019-03-28 12:45:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:18,233 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 64 transitions. 121.54/79.32 [2019-03-28 12:45:18,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 64 transitions. 121.54/79.32 [2019-03-28 12:45:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 121.54/79.32 [2019-03-28 12:45:18,234 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:18,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:18,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -735933566, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:18,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:18,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:18,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:18,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 121.54/79.32 [2019-03-28 12:45:18,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,263 INFO L87 Difference]: Start difference. First operand 35 states and 64 transitions. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:18,385 INFO L93 Difference]: Finished difference Result 76 states and 133 transitions. 121.54/79.32 [2019-03-28 12:45:18,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 121.54/79.32 [2019-03-28 12:45:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:18,386 INFO L225 Difference]: With dead ends: 76 121.54/79.32 [2019-03-28 12:45:18,387 INFO L226 Difference]: Without dead ends: 43 121.54/79.32 [2019-03-28 12:45:18,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 121.54/79.32 [2019-03-28 12:45:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. 121.54/79.32 [2019-03-28 12:45:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 121.54/79.32 [2019-03-28 12:45:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. 121.54/79.32 [2019-03-28 12:45:18,394 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 6 121.54/79.32 [2019-03-28 12:45:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:18,394 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 66 transitions. 121.54/79.32 [2019-03-28 12:45:18,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. 121.54/79.32 [2019-03-28 12:45:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 121.54/79.32 [2019-03-28 12:45:18,395 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:18,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:18,395 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash -735932605, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:18,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:18,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:18,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:18,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:18,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 121.54/79.32 [2019-03-28 12:45:18,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,437 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:18,541 INFO L93 Difference]: Finished difference Result 37 states and 66 transitions. 121.54/79.32 [2019-03-28 12:45:18,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 121.54/79.32 [2019-03-28 12:45:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:18,543 INFO L225 Difference]: With dead ends: 37 121.54/79.32 [2019-03-28 12:45:18,543 INFO L226 Difference]: Without dead ends: 34 121.54/79.32 [2019-03-28 12:45:18,543 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 121.54/79.32 [2019-03-28 12:45:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 121.54/79.32 [2019-03-28 12:45:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 121.54/79.32 [2019-03-28 12:45:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 121.54/79.32 [2019-03-28 12:45:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. 121.54/79.32 [2019-03-28 12:45:18,548 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 6 121.54/79.32 [2019-03-28 12:45:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:18,548 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. 121.54/79.32 [2019-03-28 12:45:18,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. 121.54/79.32 [2019-03-28 12:45:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 121.54/79.32 [2019-03-28 12:45:18,549 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:18,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:18,549 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash -735932603, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:18,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:18,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:18,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:18,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:18,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 121.54/79.32 [2019-03-28 12:45:18,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,597 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:18,696 INFO L93 Difference]: Finished difference Result 34 states and 60 transitions. 121.54/79.32 [2019-03-28 12:45:18,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 121.54/79.32 [2019-03-28 12:45:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:18,713 INFO L225 Difference]: With dead ends: 34 121.54/79.32 [2019-03-28 12:45:18,713 INFO L226 Difference]: Without dead ends: 31 121.54/79.32 [2019-03-28 12:45:18,714 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 121.54/79.32 [2019-03-28 12:45:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 121.54/79.32 [2019-03-28 12:45:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 121.54/79.32 [2019-03-28 12:45:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 121.54/79.32 [2019-03-28 12:45:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. 121.54/79.32 [2019-03-28 12:45:18,718 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 6 121.54/79.32 [2019-03-28 12:45:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:18,719 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. 121.54/79.32 [2019-03-28 12:45:18,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. 121.54/79.32 [2019-03-28 12:45:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 121.54/79.32 [2019-03-28 12:45:18,719 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:18,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:18,720 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:18,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1437484825, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:18,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:18,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:18,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:18,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 121.54/79.32 [2019-03-28 12:45:18,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:18,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,748 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:18,828 INFO L93 Difference]: Finished difference Result 62 states and 102 transitions. 121.54/79.32 [2019-03-28 12:45:18,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 121.54/79.32 [2019-03-28 12:45:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:18,829 INFO L225 Difference]: With dead ends: 62 121.54/79.32 [2019-03-28 12:45:18,829 INFO L226 Difference]: Without dead ends: 29 121.54/79.32 [2019-03-28 12:45:18,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 121.54/79.32 [2019-03-28 12:45:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 121.54/79.32 [2019-03-28 12:45:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 121.54/79.32 [2019-03-28 12:45:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. 121.54/79.32 [2019-03-28 12:45:18,834 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 8 121.54/79.32 [2019-03-28 12:45:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:18,834 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 46 transitions. 121.54/79.32 [2019-03-28 12:45:18,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 46 transitions. 121.54/79.32 [2019-03-28 12:45:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 121.54/79.32 [2019-03-28 12:45:18,835 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:18,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:18,836 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash -755262567, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:18,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:18,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:18,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:18,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 121.54/79.32 [2019-03-28 12:45:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,868 INFO L87 Difference]: Start difference. First operand 29 states and 46 transitions. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:18,941 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. 121.54/79.32 [2019-03-28 12:45:18,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 121.54/79.32 [2019-03-28 12:45:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:18,943 INFO L225 Difference]: With dead ends: 29 121.54/79.32 [2019-03-28 12:45:18,943 INFO L226 Difference]: Without dead ends: 25 121.54/79.32 [2019-03-28 12:45:18,943 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 121.54/79.32 [2019-03-28 12:45:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 121.54/79.32 [2019-03-28 12:45:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 121.54/79.32 [2019-03-28 12:45:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 121.54/79.32 [2019-03-28 12:45:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. 121.54/79.32 [2019-03-28 12:45:18,947 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 10 121.54/79.32 [2019-03-28 12:45:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:18,947 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. 121.54/79.32 [2019-03-28 12:45:18,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. 121.54/79.32 [2019-03-28 12:45:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 121.54/79.32 [2019-03-28 12:45:18,948 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:18,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:18,948 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash -755262565, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:18,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:18,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:18,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 121.54/79.32 [2019-03-28 12:45:18,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:18,982 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:19,023 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. 121.54/79.32 [2019-03-28 12:45:19,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:19,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 121.54/79.32 [2019-03-28 12:45:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:19,024 INFO L225 Difference]: With dead ends: 29 121.54/79.32 [2019-03-28 12:45:19,024 INFO L226 Difference]: Without dead ends: 25 121.54/79.32 [2019-03-28 12:45:19,025 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 121.54/79.32 [2019-03-28 12:45:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 121.54/79.32 [2019-03-28 12:45:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 121.54/79.32 [2019-03-28 12:45:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 121.54/79.32 [2019-03-28 12:45:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. 121.54/79.32 [2019-03-28 12:45:19,028 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 10 121.54/79.32 [2019-03-28 12:45:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:19,029 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. 121.54/79.32 [2019-03-28 12:45:19,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. 121.54/79.32 [2019-03-28 12:45:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 121.54/79.32 [2019-03-28 12:45:19,029 INFO L394 BasicCegarLoop]: Found error trace 121.54/79.32 [2019-03-28 12:45:19,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:19,030 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== 121.54/79.32 [2019-03-28 12:45:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:19,030 INFO L82 PathProgramCache]: Analyzing trace with hash -755262564, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:19,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:19,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:19,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:19,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:19,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 121.54/79.32 [2019-03-28 12:45:19,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 121.54/79.32 [2019-03-28 12:45:19,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:19,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:19,064 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:19,114 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. 121.54/79.32 [2019-03-28 12:45:19,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:19,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 121.54/79.32 [2019-03-28 12:45:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 121.54/79.32 [2019-03-28 12:45:19,115 INFO L225 Difference]: With dead ends: 25 121.54/79.32 [2019-03-28 12:45:19,115 INFO L226 Difference]: Without dead ends: 0 121.54/79.32 [2019-03-28 12:45:19,116 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 121.54/79.32 [2019-03-28 12:45:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 121.54/79.32 [2019-03-28 12:45:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 121.54/79.32 [2019-03-28 12:45:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 121.54/79.32 [2019-03-28 12:45:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 121.54/79.32 [2019-03-28 12:45:19,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 121.54/79.32 [2019-03-28 12:45:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. 121.54/79.32 [2019-03-28 12:45:19,117 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 121.54/79.32 [2019-03-28 12:45:19,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 121.54/79.32 [2019-03-28 12:45:19,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 121.54/79.32 [2019-03-28 12:45:19,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 121.54/79.32 [2019-03-28 12:45:19,151 INFO L448 ceAbstractionStarter]: For program point L10-9(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,151 INFO L448 ceAbstractionStarter]: For program point L10-11(lines 10 19) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,152 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,152 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 18) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,153 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 10 19) the Hoare annotation is: (and (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_main_~d~0.base)) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4)) 121.54/79.32 [2019-03-28 12:45:19,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,154 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,155 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,155 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,155 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,155 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,155 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,155 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,155 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,155 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,157 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,157 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,157 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,157 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,157 INFO L448 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,157 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,157 INFO L448 ceAbstractionStarter]: For program point L10-6(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,157 INFO L448 ceAbstractionStarter]: For program point L10-7(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,158 INFO L448 ceAbstractionStarter]: For program point L10-8(line 10) no Hoare annotation was computed. 121.54/79.32 [2019-03-28 12:45:19,159 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 121.54/79.32 [2019-03-28 12:45:19,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.54/79.32 [2019-03-28 12:45:19,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.54/79.32 [2019-03-28 12:45:19,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.54/79.32 [2019-03-28 12:45:19,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.54/79.32 [2019-03-28 12:45:19,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.54/79.32 [2019-03-28 12:45:19,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.54/79.32 [2019-03-28 12:45:19,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:19 BasicIcfg 121.54/79.32 [2019-03-28 12:45:19,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 121.54/79.32 [2019-03-28 12:45:19,180 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 121.54/79.32 [2019-03-28 12:45:19,180 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 121.54/79.32 [2019-03-28 12:45:19,183 INFO L276 PluginConnector]: BuchiAutomizer initialized 121.54/79.32 [2019-03-28 12:45:19,184 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 121.54/79.32 [2019-03-28 12:45:19,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:45:16" (1/5) ... 121.54/79.32 [2019-03-28 12:45:19,185 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e862555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:19, skipping insertion in model container 121.54/79.32 [2019-03-28 12:45:19,185 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 121.54/79.32 [2019-03-28 12:45:19,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (2/5) ... 121.54/79.32 [2019-03-28 12:45:19,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e862555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:19, skipping insertion in model container 121.54/79.32 [2019-03-28 12:45:19,186 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 121.54/79.32 [2019-03-28 12:45:19,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:17" (3/5) ... 121.54/79.32 [2019-03-28 12:45:19,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e862555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:19, skipping insertion in model container 121.54/79.32 [2019-03-28 12:45:19,186 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 121.54/79.32 [2019-03-28 12:45:19,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:17" (4/5) ... 121.54/79.32 [2019-03-28 12:45:19,187 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e862555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:19, skipping insertion in model container 121.54/79.32 [2019-03-28 12:45:19,187 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 121.54/79.32 [2019-03-28 12:45:19,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:19" (5/5) ... 121.54/79.32 [2019-03-28 12:45:19,189 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 121.54/79.32 [2019-03-28 12:45:19,211 INFO L133 ementStrategyFactory]: Using default assertion order modulation 121.54/79.32 [2019-03-28 12:45:19,212 INFO L374 BuchiCegarLoop]: Interprodecural is true 121.54/79.32 [2019-03-28 12:45:19,212 INFO L375 BuchiCegarLoop]: Hoare is true 121.54/79.32 [2019-03-28 12:45:19,212 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 121.54/79.32 [2019-03-28 12:45:19,212 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 121.54/79.32 [2019-03-28 12:45:19,212 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 121.54/79.32 [2019-03-28 12:45:19,212 INFO L379 BuchiCegarLoop]: Difference is false 121.54/79.32 [2019-03-28 12:45:19,212 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 121.54/79.32 [2019-03-28 12:45:19,213 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 121.54/79.32 [2019-03-28 12:45:19,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. 121.54/79.32 [2019-03-28 12:45:19,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.32 [2019-03-28 12:45:19,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.54/79.32 [2019-03-28 12:45:19,222 INFO L119 BuchiIsEmpty]: Starting construction of run 121.54/79.32 [2019-03-28 12:45:19,227 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.54/79.32 [2019-03-28 12:45:19,227 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:19,227 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 121.54/79.32 [2019-03-28 12:45:19,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. 121.54/79.32 [2019-03-28 12:45:19,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.32 [2019-03-28 12:45:19,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.54/79.32 [2019-03-28 12:45:19,230 INFO L119 BuchiIsEmpty]: Starting construction of run 121.54/79.32 [2019-03-28 12:45:19,230 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.54/79.32 [2019-03-28 12:45:19,230 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:19,236 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue [88] 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] 11#L-1true [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 9#L11-2true 121.54/79.32 [2019-03-28 12:45:19,236 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-2true [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 31#L10-1true [174] L10-1-->L10-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem3_3|) (not |v_ULTIMATE.start_main_#t~short5_2|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 28#L10-2true [120] L10-2-->L10-6: Formula: (not |v_ULTIMATE.start_main_#t~short5_5|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} AuxVars[] AssignedVars[] 45#L10-6true [180] L10-6-->L10-7: Formula: (and (not |v_ULTIMATE.start_main_#t~short5_6|) (not |v_ULTIMATE.start_main_#t~short7_2|)) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 42#L10-7true [133] L10-7-->L10-11: Formula: (not |v_ULTIMATE.start_main_#t~short7_5|) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} AuxVars[] AssignedVars[] 32#L10-11true [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 36#L11true [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 16#L12true [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 13#L12-1true [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 41#L13true [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 9#L11-2true 121.54/79.32 [2019-03-28 12:45:19,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash 3858, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:19,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:19,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2145126493, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:19,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:19,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:19,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:19,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 121.54/79.32 [2019-03-28 12:45:19,289 INFO L811 eck$LassoCheckResult]: loop already infeasible 121.54/79.32 [2019-03-28 12:45:19,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:19,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:19,290 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:19,417 INFO L93 Difference]: Finished difference Result 45 states and 81 transitions. 121.54/79.32 [2019-03-28 12:45:19,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:19,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 81 transitions. 121.54/79.32 [2019-03-28 12:45:19,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.32 [2019-03-28 12:45:19,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 21 states and 33 transitions. 121.54/79.32 [2019-03-28 12:45:19,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 121.54/79.32 [2019-03-28 12:45:19,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 121.54/79.32 [2019-03-28 12:45:19,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. 121.54/79.32 [2019-03-28 12:45:19,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 121.54/79.32 [2019-03-28 12:45:19,426 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. 121.54/79.32 [2019-03-28 12:45:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. 121.54/79.32 [2019-03-28 12:45:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 121.54/79.32 [2019-03-28 12:45:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 121.54/79.32 [2019-03-28 12:45:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. 121.54/79.32 [2019-03-28 12:45:19,429 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. 121.54/79.32 [2019-03-28 12:45:19,429 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. 121.54/79.32 [2019-03-28 12:45:19,429 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 121.54/79.32 [2019-03-28 12:45:19,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. 121.54/79.32 [2019-03-28 12:45:19,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.32 [2019-03-28 12:45:19,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.54/79.32 [2019-03-28 12:45:19,430 INFO L119 BuchiIsEmpty]: Starting construction of run 121.54/79.32 [2019-03-28 12:45:19,430 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.54/79.32 [2019-03-28 12:45:19,431 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:19,431 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY [88] 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] 110#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 102#L11-2 121.54/79.32 [2019-03-28 12:45:19,432 INFO L796 eck$LassoCheckResult]: Loop: 102#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 107#L10-1 [174] L10-1-->L10-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem3_3|) (not |v_ULTIMATE.start_main_#t~short5_2|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 106#L10-2 [120] L10-2-->L10-6: Formula: (not |v_ULTIMATE.start_main_#t~short5_5|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} AuxVars[] AssignedVars[] 104#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 117#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 116#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 115#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 108#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 109#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 112#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 113#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 114#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 102#L11-2 121.54/79.32 [2019-03-28 12:45:19,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:19,432 INFO L82 PathProgramCache]: Analyzing trace with hash 3858, now seen corresponding path program 2 times 121.54/79.32 [2019-03-28 12:45:19,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:19,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:19,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1046453311, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:19,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:19,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:19,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 121.54/79.32 [2019-03-28 12:45:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 121.54/79.32 [2019-03-28 12:45:19,469 INFO L811 eck$LassoCheckResult]: loop already infeasible 121.54/79.32 [2019-03-28 12:45:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 121.54/79.32 [2019-03-28 12:45:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 121.54/79.32 [2019-03-28 12:45:19,470 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. 121.54/79.32 [2019-03-28 12:45:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 121.54/79.32 [2019-03-28 12:45:19,516 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. 121.54/79.32 [2019-03-28 12:45:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 121.54/79.32 [2019-03-28 12:45:19,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 34 transitions. 121.54/79.32 [2019-03-28 12:45:19,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.32 [2019-03-28 12:45:19,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 30 transitions. 121.54/79.32 [2019-03-28 12:45:19,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 121.54/79.32 [2019-03-28 12:45:19,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 121.54/79.32 [2019-03-28 12:45:19,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. 121.54/79.32 [2019-03-28 12:45:19,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 121.54/79.32 [2019-03-28 12:45:19,519 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. 121.54/79.32 [2019-03-28 12:45:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. 121.54/79.32 [2019-03-28 12:45:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 121.54/79.32 [2019-03-28 12:45:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 121.54/79.32 [2019-03-28 12:45:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. 121.54/79.32 [2019-03-28 12:45:19,521 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. 121.54/79.32 [2019-03-28 12:45:19,521 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. 121.54/79.32 [2019-03-28 12:45:19,521 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 121.54/79.32 [2019-03-28 12:45:19,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. 121.54/79.32 [2019-03-28 12:45:19,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.32 [2019-03-28 12:45:19,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.54/79.32 [2019-03-28 12:45:19,522 INFO L119 BuchiIsEmpty]: Starting construction of run 121.54/79.32 [2019-03-28 12:45:19,523 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.54/79.32 [2019-03-28 12:45:19,523 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:19,523 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY [88] 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] 160#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 152#L11-2 121.54/79.32 [2019-03-28 12:45:19,524 INFO L796 eck$LassoCheckResult]: Loop: 152#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 157#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 156#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 155#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 153#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 154#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 167#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 166#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 165#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 158#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 159#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 162#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 163#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 164#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 152#L11-2 121.54/79.32 [2019-03-28 12:45:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 3858, now seen corresponding path program 3 times 121.54/79.32 [2019-03-28 12:45:19,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:19,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:19,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:19,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash 787980561, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:19,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:19,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:19,892 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 121.54/79.32 [2019-03-28 12:45:19,972 INFO L216 LassoAnalysis]: Preferences: 121.54/79.32 [2019-03-28 12:45:19,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.54/79.32 [2019-03-28 12:45:19,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.54/79.32 [2019-03-28 12:45:19,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.54/79.32 [2019-03-28 12:45:19,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.54/79.32 [2019-03-28 12:45:19,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.54/79.32 [2019-03-28 12:45:19,974 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.54/79.32 [2019-03-28 12:45:19,974 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.54/79.32 [2019-03-28 12:45:19,974 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 121.54/79.32 [2019-03-28 12:45:19,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.54/79.32 [2019-03-28 12:45:19,974 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.54/79.32 [2019-03-28 12:45:19,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:19,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,261 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 121.54/79.32 [2019-03-28 12:45:20,380 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 121.54/79.32 [2019-03-28 12:45:20,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:20,751 INFO L300 LassoAnalysis]: Preprocessing complete. 121.54/79.32 [2019-03-28 12:45:20,757 INFO L497 LassoAnalysis]: Using template 'affine'. 121.54/79.32 [2019-03-28 12:45:20,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:20,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:20,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:20,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:20,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:20,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:20,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:20,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:20,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:20,859 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.54/79.32 [2019-03-28 12:45:20,863 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.54/79.32 [2019-03-28 12:45:20,864 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 121.54/79.32 [2019-03-28 12:45:20,866 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.54/79.32 [2019-03-28 12:45:20,866 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 121.54/79.32 [2019-03-28 12:45:20,866 INFO L518 LassoAnalysis]: Proved termination. 121.54/79.32 [2019-03-28 12:45:20,867 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.54/79.32 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 121.54/79.32 Supporting invariants [] 121.54/79.32 [2019-03-28 12:45:20,940 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.54/79.32 [2019-03-28 12:45:20,944 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.54/79.32 [2019-03-28 12:45:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:20,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:20,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:21,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:21,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:21,116 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 35 treesize of output 19 121.54/79.32 [2019-03-28 12:45:21,117 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,125 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:21,126 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,127 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.54/79.32 [2019-03-28 12:45:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:21,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:21,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:21,257 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 28 treesize of output 16 121.54/79.32 [2019-03-28 12:45:21,257 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,263 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:21,264 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,264 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.54/79.32 [2019-03-28 12:45:21,289 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 121.54/79.32 [2019-03-28 12:45:21,289 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,296 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:21,297 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,297 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.54/79.32 [2019-03-28 12:45:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:21,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:21,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:21,382 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 28 treesize of output 16 121.54/79.32 [2019-03-28 12:45:21,383 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,390 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:21,391 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,391 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.54/79.32 [2019-03-28 12:45:21,398 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 121.54/79.32 [2019-03-28 12:45:21,399 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,407 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:21,408 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,408 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.54/79.32 [2019-03-28 12:45:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:21,426 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.54/79.32 [2019-03-28 12:45:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:21,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:21,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:21,449 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 19 treesize of output 18 121.54/79.32 [2019-03-28 12:45:21,450 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,457 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:21,457 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:21,458 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.54/79.32 [2019-03-28 12:45:21,467 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 121.54/79.32 [2019-03-28 12:45:21,472 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 121.54/79.32 [2019-03-28 12:45:21,473 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 30 transitions. cyclomatic complexity: 10 Second operand 6 states. 121.54/79.32 [2019-03-28 12:45:21,809 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 30 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 90 states and 108 transitions. Complement of second has 22 states. 121.54/79.32 [2019-03-28 12:45:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 121.54/79.32 [2019-03-28 12:45:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 121.54/79.32 [2019-03-28 12:45:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. 121.54/79.32 [2019-03-28 12:45:21,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. 121.54/79.32 [2019-03-28 12:45:21,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.32 [2019-03-28 12:45:21,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. 121.54/79.32 [2019-03-28 12:45:21,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.32 [2019-03-28 12:45:21,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. 121.54/79.32 [2019-03-28 12:45:21,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.32 [2019-03-28 12:45:21,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 108 transitions. 121.54/79.32 [2019-03-28 12:45:21,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 121.54/79.32 [2019-03-28 12:45:21,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 68 states and 82 transitions. 121.54/79.32 [2019-03-28 12:45:21,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 121.54/79.32 [2019-03-28 12:45:21,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 121.54/79.32 [2019-03-28 12:45:21,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 82 transitions. 121.54/79.32 [2019-03-28 12:45:21,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.54/79.32 [2019-03-28 12:45:21,828 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. 121.54/79.32 [2019-03-28 12:45:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 82 transitions. 121.54/79.32 [2019-03-28 12:45:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. 121.54/79.32 [2019-03-28 12:45:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 121.54/79.32 [2019-03-28 12:45:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. 121.54/79.32 [2019-03-28 12:45:21,831 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.54/79.32 [2019-03-28 12:45:21,832 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.54/79.32 [2019-03-28 12:45:21,832 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 121.54/79.32 [2019-03-28 12:45:21,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. 121.54/79.32 [2019-03-28 12:45:21,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.32 [2019-03-28 12:45:21,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.54/79.32 [2019-03-28 12:45:21,833 INFO L119 BuchiIsEmpty]: Starting construction of run 121.54/79.32 [2019-03-28 12:45:21,833 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.54/79.32 [2019-03-28 12:45:21,834 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:21,834 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY [88] 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] 612#L-1 [168] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 595#L11-2 121.54/79.32 [2019-03-28 12:45:21,835 INFO L796 eck$LassoCheckResult]: Loop: 595#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 605#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 603#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 600#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 601#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 634#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 633#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 632#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 631#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 630#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 629#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 622#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 615#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 616#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 595#L11-2 121.54/79.32 [2019-03-28 12:45:21,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 3857, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:21,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 2 times 121.54/79.32 [2019-03-28 12:45:21,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:21,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:21,866 INFO L82 PathProgramCache]: Analyzing trace with hash -719571248, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:21,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:21,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:21,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:22,162 INFO L216 LassoAnalysis]: Preferences: 121.54/79.32 [2019-03-28 12:45:22,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.54/79.32 [2019-03-28 12:45:22,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.54/79.32 [2019-03-28 12:45:22,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.54/79.32 [2019-03-28 12:45:22,163 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.54/79.32 [2019-03-28 12:45:22,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.54/79.32 [2019-03-28 12:45:22,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.54/79.32 [2019-03-28 12:45:22,163 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.54/79.32 [2019-03-28 12:45:22,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 121.54/79.32 [2019-03-28 12:45:22,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.54/79.32 [2019-03-28 12:45:22,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.54/79.32 [2019-03-28 12:45:22,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,410 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 121.54/79.32 [2019-03-28 12:45:22,526 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 121.54/79.32 [2019-03-28 12:45:22,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:22,879 INFO L300 LassoAnalysis]: Preprocessing complete. 121.54/79.32 [2019-03-28 12:45:22,880 INFO L497 LassoAnalysis]: Using template 'affine'. 121.54/79.32 [2019-03-28 12:45:22,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:22,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:22,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:22,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:22,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:22,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:22,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:22,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:22,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:22,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.54/79.32 [2019-03-28 12:45:22,936 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.54/79.32 [2019-03-28 12:45:22,937 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 121.54/79.32 [2019-03-28 12:45:22,937 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.54/79.32 [2019-03-28 12:45:22,937 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 121.54/79.32 [2019-03-28 12:45:22,937 INFO L518 LassoAnalysis]: Proved termination. 121.54/79.32 [2019-03-28 12:45:22,937 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.54/79.32 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 121.54/79.32 Supporting invariants [] 121.54/79.32 [2019-03-28 12:45:23,002 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.54/79.32 [2019-03-28 12:45:23,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.54/79.32 [2019-03-28 12:45:23,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:23,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:23,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:23,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:23,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:23,122 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 35 treesize of output 19 121.54/79.32 [2019-03-28 12:45:23,122 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,146 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:23,147 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,147 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.54/79.32 [2019-03-28 12:45:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.32 [2019-03-28 12:45:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:23,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:23,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:23,273 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 28 treesize of output 16 121.54/79.32 [2019-03-28 12:45:23,274 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,280 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:23,280 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,280 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.54/79.32 [2019-03-28 12:45:23,306 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 121.54/79.32 [2019-03-28 12:45:23,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,313 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:23,314 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,314 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.54/79.32 [2019-03-28 12:45:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:23,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:23,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:23,376 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 28 treesize of output 16 121.54/79.32 [2019-03-28 12:45:23,376 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,383 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:23,384 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,384 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.54/79.32 [2019-03-28 12:45:23,400 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 121.54/79.32 [2019-03-28 12:45:23,400 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,406 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:23,407 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,407 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.54/79.32 [2019-03-28 12:45:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:23,422 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.54/79.32 [2019-03-28 12:45:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.32 [2019-03-28 12:45:23,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.32 [2019-03-28 12:45:23,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.32 [2019-03-28 12:45:23,441 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 19 treesize of output 18 121.54/79.32 [2019-03-28 12:45:23,441 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,448 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.32 [2019-03-28 12:45:23,449 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.32 [2019-03-28 12:45:23,449 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.54/79.32 [2019-03-28 12:45:23,459 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 121.54/79.32 [2019-03-28 12:45:23,460 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 121.54/79.32 [2019-03-28 12:45:23,460 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. 121.54/79.32 [2019-03-28 12:45:23,804 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. 121.54/79.32 [2019-03-28 12:45:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 121.54/79.32 [2019-03-28 12:45:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 121.54/79.32 [2019-03-28 12:45:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. 121.54/79.32 [2019-03-28 12:45:23,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. 121.54/79.32 [2019-03-28 12:45:23,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.32 [2019-03-28 12:45:23,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. 121.54/79.32 [2019-03-28 12:45:23,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.32 [2019-03-28 12:45:23,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. 121.54/79.32 [2019-03-28 12:45:23,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.32 [2019-03-28 12:45:23,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. 121.54/79.32 [2019-03-28 12:45:23,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 121.54/79.32 [2019-03-28 12:45:23,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. 121.54/79.32 [2019-03-28 12:45:23,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 121.54/79.32 [2019-03-28 12:45:23,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 121.54/79.32 [2019-03-28 12:45:23,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. 121.54/79.32 [2019-03-28 12:45:23,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.54/79.32 [2019-03-28 12:45:23,817 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. 121.54/79.32 [2019-03-28 12:45:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. 121.54/79.32 [2019-03-28 12:45:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. 121.54/79.32 [2019-03-28 12:45:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 121.54/79.32 [2019-03-28 12:45:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. 121.54/79.32 [2019-03-28 12:45:23,821 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.54/79.32 [2019-03-28 12:45:23,821 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.54/79.32 [2019-03-28 12:45:23,821 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 121.54/79.32 [2019-03-28 12:45:23,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. 121.54/79.32 [2019-03-28 12:45:23,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.32 [2019-03-28 12:45:23,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.54/79.32 [2019-03-28 12:45:23,822 INFO L119 BuchiIsEmpty]: Starting construction of run 121.54/79.32 [2019-03-28 12:45:23,822 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.54/79.32 [2019-03-28 12:45:23,823 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.32 [2019-03-28 12:45:23,823 INFO L794 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY [88] 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] 1103#L-1 [167] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1090#L11-2 121.54/79.32 [2019-03-28 12:45:23,823 INFO L796 eck$LassoCheckResult]: Loop: 1090#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1131#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 1130#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 1129#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1128#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 1123#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1121#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 1118#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1119#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1125#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1124#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 1117#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1111#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1112#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 1090#L11-2 121.54/79.32 [2019-03-28 12:45:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:23,824 INFO L82 PathProgramCache]: Analyzing trace with hash 3856, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:23,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:23,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 3 times 121.54/79.32 [2019-03-28 12:45:23,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:23,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:23,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.32 [2019-03-28 12:45:23,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2067844239, now seen corresponding path program 1 times 121.54/79.32 [2019-03-28 12:45:23,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.32 [2019-03-28 12:45:23,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.32 [2019-03-28 12:45:23,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.32 [2019-03-28 12:45:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.32 [2019-03-28 12:45:24,168 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 121.54/79.32 [2019-03-28 12:45:24,230 INFO L216 LassoAnalysis]: Preferences: 121.54/79.32 [2019-03-28 12:45:24,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.54/79.32 [2019-03-28 12:45:24,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.54/79.32 [2019-03-28 12:45:24,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.54/79.32 [2019-03-28 12:45:24,231 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.54/79.32 [2019-03-28 12:45:24,231 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.54/79.32 [2019-03-28 12:45:24,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.54/79.32 [2019-03-28 12:45:24,231 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.54/79.32 [2019-03-28 12:45:24,231 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 121.54/79.32 [2019-03-28 12:45:24,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.54/79.32 [2019-03-28 12:45:24,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.54/79.32 [2019-03-28 12:45:24,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,436 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 121.54/79.32 [2019-03-28 12:45:24,546 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 121.54/79.32 [2019-03-28 12:45:24,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.32 [2019-03-28 12:45:24,889 INFO L300 LassoAnalysis]: Preprocessing complete. 121.54/79.32 [2019-03-28 12:45:24,889 INFO L497 LassoAnalysis]: Using template 'affine'. 121.54/79.32 [2019-03-28 12:45:24,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:24,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:24,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:24,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:24,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:24,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:24,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:24,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:24,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:24,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:24,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:24,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:24,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:24,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:24,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:24,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:24,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:24,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:24,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:24,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:24,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:24,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:24,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:24,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:24,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:24,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:24,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:24,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:24,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:24,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:24,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:24,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:24,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:24,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:24,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:24,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:24,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:24,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:24,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:24,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:24,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:24,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:24,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:24,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:24,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:24,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.32 [2019-03-28 12:45:24,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.32 [2019-03-28 12:45:24,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.32 [2019-03-28 12:45:24,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.32 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.32 Number of strict supporting invariants: 0 121.54/79.32 Number of non-strict supporting invariants: 1 121.54/79.32 Consider only non-deceasing supporting invariants: true 121.54/79.32 Simplify termination arguments: true 121.54/79.32 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.32 [2019-03-28 12:45:24,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.32 [2019-03-28 12:45:24,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.32 [2019-03-28 12:45:24,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.32 [2019-03-28 12:45:24,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.32 [2019-03-28 12:45:24,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.32 [2019-03-28 12:45:24,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.33 [2019-03-28 12:45:24,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.33 [2019-03-28 12:45:24,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.33 [2019-03-28 12:45:24,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.33 Number of strict supporting invariants: 0 121.54/79.33 Number of non-strict supporting invariants: 1 121.54/79.33 Consider only non-deceasing supporting invariants: true 121.54/79.33 Simplify termination arguments: true 121.54/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.33 [2019-03-28 12:45:24,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.33 [2019-03-28 12:45:24,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.33 [2019-03-28 12:45:24,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.33 [2019-03-28 12:45:24,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.33 [2019-03-28 12:45:24,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.33 [2019-03-28 12:45:24,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.33 [2019-03-28 12:45:24,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.33 [2019-03-28 12:45:24,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.33 [2019-03-28 12:45:24,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.33 Number of strict supporting invariants: 0 121.54/79.33 Number of non-strict supporting invariants: 1 121.54/79.33 Consider only non-deceasing supporting invariants: true 121.54/79.33 Simplify termination arguments: true 121.54/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.33 [2019-03-28 12:45:24,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.33 [2019-03-28 12:45:24,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.33 [2019-03-28 12:45:24,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.33 [2019-03-28 12:45:24,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.33 [2019-03-28 12:45:24,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.33 [2019-03-28 12:45:24,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.33 [2019-03-28 12:45:24,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.33 [2019-03-28 12:45:24,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.33 Number of strict supporting invariants: 0 121.54/79.33 Number of non-strict supporting invariants: 1 121.54/79.33 Consider only non-deceasing supporting invariants: true 121.54/79.33 Simplify termination arguments: true 121.54/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.33 [2019-03-28 12:45:24,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.33 [2019-03-28 12:45:24,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.33 [2019-03-28 12:45:24,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.33 [2019-03-28 12:45:24,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.33 [2019-03-28 12:45:24,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.33 [2019-03-28 12:45:24,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.33 [2019-03-28 12:45:24,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.33 [2019-03-28 12:45:24,942 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.54/79.33 [2019-03-28 12:45:24,943 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.54/79.33 [2019-03-28 12:45:24,943 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 121.54/79.33 [2019-03-28 12:45:24,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.54/79.33 [2019-03-28 12:45:24,944 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 121.54/79.33 [2019-03-28 12:45:24,944 INFO L518 LassoAnalysis]: Proved termination. 121.54/79.33 [2019-03-28 12:45:24,944 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.54/79.33 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 121.54/79.33 Supporting invariants [] 121.54/79.33 [2019-03-28 12:45:25,023 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.54/79.33 [2019-03-28 12:45:25,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.54/79.33 [2019-03-28 12:45:25,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.33 [2019-03-28 12:45:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.33 [2019-03-28 12:45:25,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.33 [2019-03-28 12:45:25,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.33 [2019-03-28 12:45:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.33 [2019-03-28 12:45:25,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.33 [2019-03-28 12:45:25,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.33 [2019-03-28 12:45:25,133 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 35 treesize of output 19 121.54/79.33 [2019-03-28 12:45:25,134 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,142 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.33 [2019-03-28 12:45:25,143 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,143 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.54/79.33 [2019-03-28 12:45:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.54/79.33 [2019-03-28 12:45:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.33 [2019-03-28 12:45:25,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.33 [2019-03-28 12:45:25,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.33 [2019-03-28 12:45:25,273 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 28 treesize of output 16 121.54/79.33 [2019-03-28 12:45:25,274 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,280 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.33 [2019-03-28 12:45:25,281 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,281 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.54/79.33 [2019-03-28 12:45:25,305 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 121.54/79.33 [2019-03-28 12:45:25,305 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,311 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.33 [2019-03-28 12:45:25,312 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,313 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.54/79.33 [2019-03-28 12:45:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.33 [2019-03-28 12:45:25,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.33 [2019-03-28 12:45:25,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.33 [2019-03-28 12:45:25,397 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 28 treesize of output 16 121.54/79.33 [2019-03-28 12:45:25,397 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,403 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.33 [2019-03-28 12:45:25,404 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,404 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.54/79.33 [2019-03-28 12:45:25,409 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 121.54/79.33 [2019-03-28 12:45:25,410 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,416 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.33 [2019-03-28 12:45:25,416 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,416 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.54/79.33 [2019-03-28 12:45:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.33 [2019-03-28 12:45:25,433 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.54/79.33 [2019-03-28 12:45:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.54/79.33 [2019-03-28 12:45:25,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.54/79.33 [2019-03-28 12:45:25,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.54/79.33 [2019-03-28 12:45:25,457 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 19 treesize of output 18 121.54/79.33 [2019-03-28 12:45:25,458 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,470 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.54/79.33 [2019-03-28 12:45:25,470 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.54/79.33 [2019-03-28 12:45:25,471 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.54/79.33 [2019-03-28 12:45:25,480 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 121.54/79.33 [2019-03-28 12:45:25,480 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 121.54/79.33 [2019-03-28 12:45:25,480 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. 121.54/79.33 [2019-03-28 12:45:25,823 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. 121.54/79.33 [2019-03-28 12:45:25,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 121.54/79.33 [2019-03-28 12:45:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 121.54/79.33 [2019-03-28 12:45:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. 121.54/79.33 [2019-03-28 12:45:25,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. 121.54/79.33 [2019-03-28 12:45:25,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.33 [2019-03-28 12:45:25,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. 121.54/79.33 [2019-03-28 12:45:25,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.33 [2019-03-28 12:45:25,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. 121.54/79.33 [2019-03-28 12:45:25,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.54/79.33 [2019-03-28 12:45:25,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. 121.54/79.33 [2019-03-28 12:45:25,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 121.54/79.33 [2019-03-28 12:45:25,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. 121.54/79.33 [2019-03-28 12:45:25,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 121.54/79.33 [2019-03-28 12:45:25,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 121.54/79.33 [2019-03-28 12:45:25,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. 121.54/79.33 [2019-03-28 12:45:25,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.54/79.33 [2019-03-28 12:45:25,834 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. 121.54/79.33 [2019-03-28 12:45:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. 121.54/79.33 [2019-03-28 12:45:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. 121.54/79.33 [2019-03-28 12:45:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 121.54/79.33 [2019-03-28 12:45:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. 121.54/79.33 [2019-03-28 12:45:25,837 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.54/79.33 [2019-03-28 12:45:25,838 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.54/79.33 [2019-03-28 12:45:25,838 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 121.54/79.33 [2019-03-28 12:45:25,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. 121.54/79.33 [2019-03-28 12:45:25,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.54/79.33 [2019-03-28 12:45:25,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.54/79.33 [2019-03-28 12:45:25,839 INFO L119 BuchiIsEmpty]: Starting construction of run 121.54/79.33 [2019-03-28 12:45:25,839 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.54/79.33 [2019-03-28 12:45:25,839 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.54/79.33 [2019-03-28 12:45:25,840 INFO L794 eck$LassoCheckResult]: Stem: 1604#ULTIMATE.startENTRY [88] 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] 1598#L-1 [166] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1585#L11-2 121.54/79.33 [2019-03-28 12:45:25,840 INFO L796 eck$LassoCheckResult]: Loop: 1585#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1626#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 1625#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 1624#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1623#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 1618#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1616#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 1613#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1614#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1620#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1619#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 1612#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1606#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1607#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 1585#L11-2 121.54/79.33 [2019-03-28 12:45:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.33 [2019-03-28 12:45:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash 3855, now seen corresponding path program 1 times 121.54/79.33 [2019-03-28 12:45:25,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.33 [2019-03-28 12:45:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.33 [2019-03-28 12:45:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.33 [2019-03-28 12:45:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.33 [2019-03-28 12:45:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.33 [2019-03-28 12:45:25,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 4 times 121.54/79.33 [2019-03-28 12:45:25,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.33 [2019-03-28 12:45:25,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.33 [2019-03-28 12:45:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.33 [2019-03-28 12:45:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.33 [2019-03-28 12:45:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.54/79.33 [2019-03-28 12:45:25,865 INFO L82 PathProgramCache]: Analyzing trace with hash 560292430, now seen corresponding path program 1 times 121.54/79.33 [2019-03-28 12:45:25,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.54/79.33 [2019-03-28 12:45:25,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.54/79.33 [2019-03-28 12:45:25,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.54/79.33 [2019-03-28 12:45:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.33 [2019-03-28 12:45:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.54/79.33 [2019-03-28 12:45:26,126 INFO L216 LassoAnalysis]: Preferences: 121.54/79.33 [2019-03-28 12:45:26,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.54/79.33 [2019-03-28 12:45:26,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.54/79.33 [2019-03-28 12:45:26,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.54/79.33 [2019-03-28 12:45:26,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.54/79.33 [2019-03-28 12:45:26,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.54/79.33 [2019-03-28 12:45:26,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.54/79.33 [2019-03-28 12:45:26,127 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.54/79.33 [2019-03-28 12:45:26,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 121.54/79.33 [2019-03-28 12:45:26,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.54/79.33 [2019-03-28 12:45:26,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.54/79.33 [2019-03-28 12:45:26,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,332 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 121.54/79.33 [2019-03-28 12:45:26,440 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 121.54/79.33 [2019-03-28 12:45:26,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.54/79.33 [2019-03-28 12:45:26,795 INFO L300 LassoAnalysis]: Preprocessing complete. 121.54/79.33 [2019-03-28 12:45:26,796 INFO L497 LassoAnalysis]: Using template 'affine'. 121.54/79.33 [2019-03-28 12:45:26,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.33 Number of strict supporting invariants: 0 121.54/79.33 Number of non-strict supporting invariants: 1 121.54/79.33 Consider only non-deceasing supporting invariants: true 121.54/79.33 Simplify termination arguments: true 121.54/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.33 [2019-03-28 12:45:26,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.33 [2019-03-28 12:45:26,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.54/79.33 [2019-03-28 12:45:26,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.33 [2019-03-28 12:45:26,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.33 [2019-03-28 12:45:26,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.33 [2019-03-28 12:45:26,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.54/79.33 [2019-03-28 12:45:26,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.54/79.33 [2019-03-28 12:45:26,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.33 [2019-03-28 12:45:26,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.33 Number of strict supporting invariants: 0 121.54/79.33 Number of non-strict supporting invariants: 1 121.54/79.33 Consider only non-deceasing supporting invariants: true 121.54/79.33 Simplify termination arguments: true 121.54/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.33 [2019-03-28 12:45:26,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.33 [2019-03-28 12:45:26,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.33 [2019-03-28 12:45:26,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.33 [2019-03-28 12:45:26,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.33 [2019-03-28 12:45:26,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.33 [2019-03-28 12:45:26,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.33 [2019-03-28 12:45:26,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.33 [2019-03-28 12:45:26,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.33 Number of strict supporting invariants: 0 121.54/79.33 Number of non-strict supporting invariants: 1 121.54/79.33 Consider only non-deceasing supporting invariants: true 121.54/79.33 Simplify termination arguments: true 121.54/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.33 [2019-03-28 12:45:26,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.33 [2019-03-28 12:45:26,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.33 [2019-03-28 12:45:26,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.33 [2019-03-28 12:45:26,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.33 [2019-03-28 12:45:26,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.33 [2019-03-28 12:45:26,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.33 [2019-03-28 12:45:26,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.33 [2019-03-28 12:45:26,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.54/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.54/79.33 Number of strict supporting invariants: 0 121.54/79.33 Number of non-strict supporting invariants: 1 121.54/79.33 Consider only non-deceasing supporting invariants: true 121.54/79.33 Simplify termination arguments: true 121.54/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.54/79.33 [2019-03-28 12:45:26,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.54/79.33 [2019-03-28 12:45:26,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.54/79.33 [2019-03-28 12:45:26,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.54/79.33 [2019-03-28 12:45:26,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.54/79.33 [2019-03-28 12:45:26,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.54/79.33 [2019-03-28 12:45:26,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.54/79.33 [2019-03-28 12:45:26,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.54/79.33 [2019-03-28 12:45:26,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:26,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:26,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:26,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:26,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:26,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:26,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:26,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:26,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:26,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:26,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:26,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:26,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:26,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:26,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:26,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:26,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:26,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:26,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:26,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:26,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:26,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:26,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:26,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:26,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:26,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:26,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:26,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:26,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:26,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:26,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:26,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:26,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:26,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:26,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:26,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:26,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:26,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:26,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:26,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:26,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:26,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:26,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:26,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:26,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:26,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:26,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:26,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:26,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:26,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:26,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:26,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:26,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:26,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:26,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:26,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:26,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:26,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:26,850 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.33 [2019-03-28 12:45:26,851 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.63/79.33 [2019-03-28 12:45:26,851 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 121.63/79.33 [2019-03-28 12:45:26,852 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.33 [2019-03-28 12:45:26,852 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 121.63/79.33 [2019-03-28 12:45:26,852 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.33 [2019-03-28 12:45:26,852 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.33 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 121.63/79.33 Supporting invariants [] 121.63/79.33 [2019-03-28 12:45:26,919 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.63/79.33 [2019-03-28 12:45:26,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.33 [2019-03-28 12:45:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:26,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:26,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:26,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:26,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:27,030 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 35 treesize of output 19 121.63/79.33 [2019-03-28 12:45:27,031 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,038 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:27,039 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,039 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.63/79.33 [2019-03-28 12:45:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.63/79.33 [2019-03-28 12:45:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:27,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:27,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:27,154 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:27,155 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,161 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:27,161 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,161 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:27,182 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 121.63/79.33 [2019-03-28 12:45:27,182 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,188 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:27,188 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,189 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:27,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:27,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:27,242 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:27,243 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,248 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:27,249 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,249 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:27,253 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 121.63/79.33 [2019-03-28 12:45:27,254 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,259 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:27,259 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,260 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:27,272 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.33 [2019-03-28 12:45:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:27,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:27,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:27,286 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 19 treesize of output 18 121.63/79.33 [2019-03-28 12:45:27,286 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,292 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:27,292 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:27,293 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.63/79.33 [2019-03-28 12:45:27,301 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 121.63/79.33 [2019-03-28 12:45:27,301 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 121.63/79.33 [2019-03-28 12:45:27,301 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. 121.63/79.33 [2019-03-28 12:45:27,626 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. 121.63/79.33 [2019-03-28 12:45:27,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 121.63/79.33 [2019-03-28 12:45:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 121.63/79.33 [2019-03-28 12:45:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. 121.63/79.33 [2019-03-28 12:45:27,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:27,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:27,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:27,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:27,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. 121.63/79.33 [2019-03-28 12:45:27,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:27,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. 121.63/79.33 [2019-03-28 12:45:27,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 121.63/79.33 [2019-03-28 12:45:27,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:27,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 121.63/79.33 [2019-03-28 12:45:27,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 121.63/79.33 [2019-03-28 12:45:27,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:27,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.63/79.33 [2019-03-28 12:45:27,637 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. 121.63/79.33 [2019-03-28 12:45:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 121.63/79.33 [2019-03-28 12:45:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:27,640 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:27,640 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:27,640 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 121.63/79.33 [2019-03-28 12:45:27,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:27,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.63/79.33 [2019-03-28 12:45:27,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.63/79.33 [2019-03-28 12:45:27,641 INFO L119 BuchiIsEmpty]: Starting construction of run 121.63/79.33 [2019-03-28 12:45:27,641 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.63/79.33 [2019-03-28 12:45:27,641 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.33 [2019-03-28 12:45:27,642 INFO L794 eck$LassoCheckResult]: Stem: 2100#ULTIMATE.startENTRY [88] 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] 2098#L-1 [165] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2080#L11-2 121.63/79.33 [2019-03-28 12:45:27,642 INFO L796 eck$LassoCheckResult]: Loop: 2080#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2093#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 2087#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 2085#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 2081#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 2082#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 2112#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 2109#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2110#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 2115#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2114#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 2108#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2102#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 2103#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 2080#L11-2 121.63/79.33 [2019-03-28 12:45:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash 3854, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:27,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:27,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:27,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:27,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 5 times 121.63/79.33 [2019-03-28 12:45:27,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:27,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:27,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash -947259379, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:27,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:27,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:27,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:27,930 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 121.63/79.33 [2019-03-28 12:45:27,999 INFO L216 LassoAnalysis]: Preferences: 121.63/79.33 [2019-03-28 12:45:27,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.63/79.33 [2019-03-28 12:45:27,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.63/79.33 [2019-03-28 12:45:27,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.63/79.33 [2019-03-28 12:45:27,999 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.63/79.33 [2019-03-28 12:45:28,000 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.63/79.33 [2019-03-28 12:45:28,000 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.63/79.33 [2019-03-28 12:45:28,000 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.63/79.33 [2019-03-28 12:45:28,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 121.63/79.33 [2019-03-28 12:45:28,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.63/79.33 [2019-03-28 12:45:28,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.63/79.33 [2019-03-28 12:45:28,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,184 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 121.63/79.33 [2019-03-28 12:45:28,291 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 121.63/79.33 [2019-03-28 12:45:28,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:28,628 INFO L300 LassoAnalysis]: Preprocessing complete. 121.63/79.33 [2019-03-28 12:45:28,628 INFO L497 LassoAnalysis]: Using template 'affine'. 121.63/79.33 [2019-03-28 12:45:28,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:28,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:28,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:28,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:28,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:28,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:28,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:28,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:28,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:28,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:28,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:28,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:28,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:28,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:28,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:28,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:28,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:28,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:28,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:28,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:28,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:28,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:28,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:28,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:28,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:28,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:28,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:28,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:28,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:28,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:28,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:28,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:28,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:28,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:28,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:28,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:28,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:28,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:28,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:28,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:28,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:28,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:28,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:28,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:28,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:28,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:28,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:28,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:28,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:28,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:28,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:28,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:28,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:28,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:28,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:28,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:28,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:28,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:28,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:28,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:28,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:28,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:28,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:28,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:28,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:28,663 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.33 [2019-03-28 12:45:28,664 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.63/79.33 [2019-03-28 12:45:28,664 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 121.63/79.33 [2019-03-28 12:45:28,664 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.33 [2019-03-28 12:45:28,664 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 121.63/79.33 [2019-03-28 12:45:28,665 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.33 [2019-03-28 12:45:28,665 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.33 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 121.63/79.33 Supporting invariants [] 121.63/79.33 [2019-03-28 12:45:28,728 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.63/79.33 [2019-03-28 12:45:28,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.33 [2019-03-28 12:45:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:28,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:28,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:28,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:28,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:28,826 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 35 treesize of output 19 121.63/79.33 [2019-03-28 12:45:28,827 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:28,841 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:28,841 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:28,842 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.63/79.33 [2019-03-28 12:45:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.63/79.33 [2019-03-28 12:45:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:28,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:28,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:28,967 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:28,968 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:28,973 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:28,973 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:28,974 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:28,994 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 121.63/79.33 [2019-03-28 12:45:28,995 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:29,000 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:29,000 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:29,000 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:29,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:29,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:29,054 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:29,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:29,060 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:29,061 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:29,061 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:29,065 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 121.63/79.33 [2019-03-28 12:45:29,066 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:29,071 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:29,071 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:29,071 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:29,083 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.33 [2019-03-28 12:45:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:29,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:29,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:29,097 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 19 treesize of output 18 121.63/79.33 [2019-03-28 12:45:29,097 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:29,103 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:29,103 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:29,103 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.63/79.33 [2019-03-28 12:45:29,111 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 121.63/79.33 [2019-03-28 12:45:29,111 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 121.63/79.33 [2019-03-28 12:45:29,111 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. 121.63/79.33 [2019-03-28 12:45:29,409 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. 121.63/79.33 [2019-03-28 12:45:29,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 121.63/79.33 [2019-03-28 12:45:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 121.63/79.33 [2019-03-28 12:45:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. 121.63/79.33 [2019-03-28 12:45:29,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:29,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:29,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:29,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:29,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. 121.63/79.33 [2019-03-28 12:45:29,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:29,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. 121.63/79.33 [2019-03-28 12:45:29,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 121.63/79.33 [2019-03-28 12:45:29,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:29,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 121.63/79.33 [2019-03-28 12:45:29,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 121.63/79.33 [2019-03-28 12:45:29,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:29,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.63/79.33 [2019-03-28 12:45:29,419 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. 121.63/79.33 [2019-03-28 12:45:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 121.63/79.33 [2019-03-28 12:45:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:29,422 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:29,422 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:29,423 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 121.63/79.33 [2019-03-28 12:45:29,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:29,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.63/79.33 [2019-03-28 12:45:29,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.63/79.33 [2019-03-28 12:45:29,423 INFO L119 BuchiIsEmpty]: Starting construction of run 121.63/79.33 [2019-03-28 12:45:29,424 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.63/79.33 [2019-03-28 12:45:29,424 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.33 [2019-03-28 12:45:29,424 INFO L794 eck$LassoCheckResult]: Stem: 2594#ULTIMATE.startENTRY [88] 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] 2592#L-1 [164] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2575#L11-2 121.63/79.33 [2019-03-28 12:45:29,425 INFO L796 eck$LassoCheckResult]: Loop: 2575#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2616#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 2615#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 2614#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 2613#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 2612#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 2611#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 2610#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2609#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 2608#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2607#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 2602#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2595#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 2596#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 2575#L11-2 121.63/79.33 [2019-03-28 12:45:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:29,425 INFO L82 PathProgramCache]: Analyzing trace with hash 3853, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:29,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:29,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 6 times 121.63/79.33 [2019-03-28 12:45:29,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:29,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1840156108, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:29,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:29,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:29,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:29,680 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 121.63/79.33 [2019-03-28 12:45:29,737 INFO L216 LassoAnalysis]: Preferences: 121.63/79.33 [2019-03-28 12:45:29,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.63/79.33 [2019-03-28 12:45:29,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.63/79.33 [2019-03-28 12:45:29,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.63/79.33 [2019-03-28 12:45:29,737 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.63/79.33 [2019-03-28 12:45:29,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.63/79.33 [2019-03-28 12:45:29,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.63/79.33 [2019-03-28 12:45:29,738 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.63/79.33 [2019-03-28 12:45:29,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 121.63/79.33 [2019-03-28 12:45:29,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.63/79.33 [2019-03-28 12:45:29,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.63/79.33 [2019-03-28 12:45:29,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:29,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:29,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:29,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:29,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:29,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:29,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:29,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:29,943 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 121.63/79.33 [2019-03-28 12:45:30,070 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 121.63/79.33 [2019-03-28 12:45:30,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:30,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:30,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:30,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:30,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:30,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:30,421 INFO L300 LassoAnalysis]: Preprocessing complete. 121.63/79.33 [2019-03-28 12:45:30,421 INFO L497 LassoAnalysis]: Using template 'affine'. 121.63/79.33 [2019-03-28 12:45:30,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:30,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:30,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:30,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:30,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:30,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:30,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:30,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:30,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:30,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:30,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:30,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:30,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:30,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:30,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:30,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:30,487 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.33 [2019-03-28 12:45:30,488 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.63/79.33 [2019-03-28 12:45:30,488 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 121.63/79.33 [2019-03-28 12:45:30,488 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.33 [2019-03-28 12:45:30,489 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 121.63/79.33 [2019-03-28 12:45:30,489 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.33 [2019-03-28 12:45:30,489 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.33 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6 121.63/79.33 Supporting invariants [] 121.63/79.33 [2019-03-28 12:45:30,550 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.63/79.33 [2019-03-28 12:45:30,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.33 [2019-03-28 12:45:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:30,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:30,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:30,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:30,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:30,653 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 35 treesize of output 19 121.63/79.33 [2019-03-28 12:45:30,654 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,663 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:30,663 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,664 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.63/79.33 [2019-03-28 12:45:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.63/79.33 [2019-03-28 12:45:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:30,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:30,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:30,798 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:30,798 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,805 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:30,805 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,806 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:30,828 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 121.63/79.33 [2019-03-28 12:45:30,828 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,834 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:30,834 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,835 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:30,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:30,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:30,888 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:30,889 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,895 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:30,895 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,895 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:30,900 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 121.63/79.33 [2019-03-28 12:45:30,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,906 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:30,906 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,907 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:30,918 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.33 [2019-03-28 12:45:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:30,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:30,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:30,934 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 19 treesize of output 18 121.63/79.33 [2019-03-28 12:45:30,934 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,940 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:30,941 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:30,941 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.63/79.33 [2019-03-28 12:45:30,948 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 121.63/79.33 [2019-03-28 12:45:30,948 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 121.63/79.33 [2019-03-28 12:45:30,949 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. 121.63/79.33 [2019-03-28 12:45:31,282 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. 121.63/79.33 [2019-03-28 12:45:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 121.63/79.33 [2019-03-28 12:45:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 121.63/79.33 [2019-03-28 12:45:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. 121.63/79.33 [2019-03-28 12:45:31,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:31,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:31,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:31,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:31,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. 121.63/79.33 [2019-03-28 12:45:31,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:31,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. 121.63/79.33 [2019-03-28 12:45:31,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 121.63/79.33 [2019-03-28 12:45:31,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:31,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 121.63/79.33 [2019-03-28 12:45:31,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 121.63/79.33 [2019-03-28 12:45:31,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:31,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.63/79.33 [2019-03-28 12:45:31,293 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. 121.63/79.33 [2019-03-28 12:45:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 121.63/79.33 [2019-03-28 12:45:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:31,297 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:31,297 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:31,297 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 121.63/79.33 [2019-03-28 12:45:31,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:31,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.63/79.33 [2019-03-28 12:45:31,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.63/79.33 [2019-03-28 12:45:31,298 INFO L119 BuchiIsEmpty]: Starting construction of run 121.63/79.33 [2019-03-28 12:45:31,299 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.63/79.33 [2019-03-28 12:45:31,299 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.33 [2019-03-28 12:45:31,299 INFO L794 eck$LassoCheckResult]: Stem: 3090#ULTIMATE.startENTRY [88] 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] 3088#L-1 [163] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3070#L11-2 121.63/79.33 [2019-03-28 12:45:31,300 INFO L796 eck$LassoCheckResult]: Loop: 3070#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3083#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 3077#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 3075#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 3071#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 3072#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 3102#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 3099#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3100#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 3105#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3104#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 3098#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 3092#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 3093#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 3070#L11-2 121.63/79.33 [2019-03-28 12:45:31,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:31,300 INFO L82 PathProgramCache]: Analyzing trace with hash 3852, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:31,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:31,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:31,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:31,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 7 times 121.63/79.33 [2019-03-28 12:45:31,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:31,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:31,319 INFO L82 PathProgramCache]: Analyzing trace with hash 332604299, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:31,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:31,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:31,579 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 121.63/79.33 [2019-03-28 12:45:31,642 INFO L216 LassoAnalysis]: Preferences: 121.63/79.33 [2019-03-28 12:45:31,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.63/79.33 [2019-03-28 12:45:31,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.63/79.33 [2019-03-28 12:45:31,643 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.63/79.33 [2019-03-28 12:45:31,643 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.63/79.33 [2019-03-28 12:45:31,643 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.63/79.33 [2019-03-28 12:45:31,643 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.63/79.33 [2019-03-28 12:45:31,643 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.63/79.33 [2019-03-28 12:45:31,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso 121.63/79.33 [2019-03-28 12:45:31,643 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.63/79.33 [2019-03-28 12:45:31,644 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.63/79.33 [2019-03-28 12:45:31,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,833 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 121.63/79.33 [2019-03-28 12:45:31,941 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 121.63/79.33 [2019-03-28 12:45:31,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:31,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:32,272 INFO L300 LassoAnalysis]: Preprocessing complete. 121.63/79.33 [2019-03-28 12:45:32,272 INFO L497 LassoAnalysis]: Using template 'affine'. 121.63/79.33 [2019-03-28 12:45:32,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:32,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:32,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:32,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:32,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:32,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:32,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:32,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:32,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:32,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:32,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:32,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:32,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:32,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:32,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:32,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:32,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:32,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:32,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:32,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:32,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:32,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:32,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:32,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:32,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:32,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:32,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:32,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:32,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:32,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:32,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:32,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:32,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:32,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:32,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:32,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:32,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:32,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:32,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:32,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:32,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:32,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:32,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:32,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:32,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:32,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:32,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:32,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:32,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:32,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:32,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:32,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:32,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:32,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:32,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:32,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:32,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:32,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:32,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:32,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:32,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:32,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:32,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:32,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:32,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:32,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:32,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.33 [2019-03-28 12:45:32,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.63/79.33 [2019-03-28 12:45:32,314 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 121.63/79.33 [2019-03-28 12:45:32,315 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.33 [2019-03-28 12:45:32,315 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 121.63/79.33 [2019-03-28 12:45:32,315 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.33 [2019-03-28 12:45:32,315 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.33 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7 121.63/79.33 Supporting invariants [] 121.63/79.33 [2019-03-28 12:45:32,379 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.63/79.33 [2019-03-28 12:45:32,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.33 [2019-03-28 12:45:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:32,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:32,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:32,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:32,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:32,509 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 35 treesize of output 19 121.63/79.33 [2019-03-28 12:45:32,510 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,520 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:32,520 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,520 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.63/79.33 [2019-03-28 12:45:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.63/79.33 [2019-03-28 12:45:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:32,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:32,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:32,650 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:32,650 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,657 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:32,657 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,657 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:32,678 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 121.63/79.33 [2019-03-28 12:45:32,679 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,684 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:32,685 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,685 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:32,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:32,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:32,738 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:32,738 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,744 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:32,744 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,744 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:32,748 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 121.63/79.33 [2019-03-28 12:45:32,749 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,754 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:32,754 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,755 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:32,766 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.33 [2019-03-28 12:45:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:32,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:32,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:32,780 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 19 treesize of output 18 121.63/79.33 [2019-03-28 12:45:32,781 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,786 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:32,786 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:32,786 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.63/79.33 [2019-03-28 12:45:32,793 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 121.63/79.33 [2019-03-28 12:45:32,794 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 121.63/79.33 [2019-03-28 12:45:32,794 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. 121.63/79.33 [2019-03-28 12:45:33,086 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. 121.63/79.33 [2019-03-28 12:45:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 121.63/79.33 [2019-03-28 12:45:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 121.63/79.33 [2019-03-28 12:45:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. 121.63/79.33 [2019-03-28 12:45:33,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:33,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:33,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:33,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:33,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. 121.63/79.33 [2019-03-28 12:45:33,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:33,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. 121.63/79.33 [2019-03-28 12:45:33,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 121.63/79.33 [2019-03-28 12:45:33,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:33,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 121.63/79.33 [2019-03-28 12:45:33,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 121.63/79.33 [2019-03-28 12:45:33,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:33,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.63/79.33 [2019-03-28 12:45:33,096 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. 121.63/79.33 [2019-03-28 12:45:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 121.63/79.33 [2019-03-28 12:45:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:33,098 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:33,098 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:33,098 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 121.63/79.33 [2019-03-28 12:45:33,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:33,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.63/79.33 [2019-03-28 12:45:33,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.63/79.33 [2019-03-28 12:45:33,099 INFO L119 BuchiIsEmpty]: Starting construction of run 121.63/79.33 [2019-03-28 12:45:33,099 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 121.63/79.33 [2019-03-28 12:45:33,100 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.33 [2019-03-28 12:45:33,100 INFO L794 eck$LassoCheckResult]: Stem: 3585#ULTIMATE.startENTRY [88] 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] 3583#L-1 [162] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3565#L11-2 121.63/79.33 [2019-03-28 12:45:33,100 INFO L796 eck$LassoCheckResult]: Loop: 3565#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3578#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 3572#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 3570#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 3566#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 3567#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 3597#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 3594#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3595#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 3600#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3599#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 3593#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 3587#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 3588#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 3565#L11-2 121.63/79.33 [2019-03-28 12:45:33,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:33,101 INFO L82 PathProgramCache]: Analyzing trace with hash 3851, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:33,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:33,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:33,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1546372032, now seen corresponding path program 8 times 121.63/79.33 [2019-03-28 12:45:33,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:33,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:33,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1174947510, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:33,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:33,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:33,368 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 121.63/79.33 [2019-03-28 12:45:33,422 INFO L216 LassoAnalysis]: Preferences: 121.63/79.33 [2019-03-28 12:45:33,423 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.63/79.33 [2019-03-28 12:45:33,423 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.63/79.33 [2019-03-28 12:45:33,423 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.63/79.33 [2019-03-28 12:45:33,423 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.63/79.33 [2019-03-28 12:45:33,423 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.63/79.33 [2019-03-28 12:45:33,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.63/79.33 [2019-03-28 12:45:33,423 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.63/79.33 [2019-03-28 12:45:33,424 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Lasso 121.63/79.33 [2019-03-28 12:45:33,424 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.63/79.33 [2019-03-28 12:45:33,424 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.63/79.33 [2019-03-28 12:45:33,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,598 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 121.63/79.33 [2019-03-28 12:45:33,706 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 121.63/79.33 [2019-03-28 12:45:33,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:33,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:34,033 INFO L300 LassoAnalysis]: Preprocessing complete. 121.63/79.33 [2019-03-28 12:45:34,033 INFO L497 LassoAnalysis]: Using template 'affine'. 121.63/79.33 [2019-03-28 12:45:34,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:34,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:34,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:34,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:34,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:34,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:34,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:34,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:34,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:34,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:34,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:34,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:34,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:34,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:34,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:34,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:34,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:34,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:34,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:34,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:34,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:34,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:34,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:34,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:34,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:34,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:34,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:34,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:34,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:34,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:34,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:34,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:34,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:34,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:34,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:34,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:34,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:34,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:34,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:34,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:34,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:34,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:34,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:34,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:34,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:34,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:34,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:34,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:34,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:34,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:34,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:34,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:34,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.33 [2019-03-28 12:45:34,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:34,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:34,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:34,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:34,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:34,078 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.33 [2019-03-28 12:45:34,079 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.63/79.33 [2019-03-28 12:45:34,079 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 121.63/79.33 [2019-03-28 12:45:34,080 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.33 [2019-03-28 12:45:34,080 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 121.63/79.33 [2019-03-28 12:45:34,080 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.33 [2019-03-28 12:45:34,080 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.33 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8 121.63/79.33 Supporting invariants [] 121.63/79.33 [2019-03-28 12:45:34,145 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.63/79.33 [2019-03-28 12:45:34,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.33 [2019-03-28 12:45:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:34,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:34,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:34,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:34,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:34,246 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 35 treesize of output 19 121.63/79.33 [2019-03-28 12:45:34,246 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,253 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:34,253 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,253 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.63/79.33 [2019-03-28 12:45:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.63/79.33 [2019-03-28 12:45:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:34,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:34,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:34,368 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:34,369 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,375 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:34,375 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,375 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:34,395 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 121.63/79.33 [2019-03-28 12:45:34,396 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,401 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:34,401 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,401 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:34,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:34,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:34,455 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 28 treesize of output 16 121.63/79.33 [2019-03-28 12:45:34,455 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,462 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:34,463 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,463 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.33 [2019-03-28 12:45:34,469 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 121.63/79.33 [2019-03-28 12:45:34,469 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,477 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:34,477 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,477 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.33 [2019-03-28 12:45:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:34,492 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.33 [2019-03-28 12:45:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.33 [2019-03-28 12:45:34,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.33 [2019-03-28 12:45:34,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.33 [2019-03-28 12:45:34,511 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 19 treesize of output 18 121.63/79.33 [2019-03-28 12:45:34,511 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,518 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.33 [2019-03-28 12:45:34,519 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.33 [2019-03-28 12:45:34,519 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.63/79.33 [2019-03-28 12:45:34,527 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 121.63/79.33 [2019-03-28 12:45:34,527 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 121.63/79.33 [2019-03-28 12:45:34,528 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 6 states. 121.63/79.33 [2019-03-28 12:45:34,819 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 116 states and 137 transitions. Complement of second has 22 states. 121.63/79.33 [2019-03-28 12:45:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 121.63/79.33 [2019-03-28 12:45:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 121.63/79.33 [2019-03-28 12:45:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. 121.63/79.33 [2019-03-28 12:45:34,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:34,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:34,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 16 letters. Loop has 14 letters. 121.63/79.33 [2019-03-28 12:45:34,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:34,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 2 letters. Loop has 28 letters. 121.63/79.33 [2019-03-28 12:45:34,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.33 [2019-03-28 12:45:34,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 137 transitions. 121.63/79.33 [2019-03-28 12:45:34,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 121.63/79.33 [2019-03-28 12:45:34,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:34,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 121.63/79.33 [2019-03-28 12:45:34,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 121.63/79.33 [2019-03-28 12:45:34,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:34,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.63/79.33 [2019-03-28 12:45:34,828 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 111 transitions. 121.63/79.33 [2019-03-28 12:45:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. 121.63/79.33 [2019-03-28 12:45:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 121.63/79.33 [2019-03-28 12:45:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:34,830 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:34,830 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:34,830 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 121.63/79.33 [2019-03-28 12:45:34,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. 121.63/79.33 [2019-03-28 12:45:34,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 121.63/79.33 [2019-03-28 12:45:34,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.63/79.33 [2019-03-28 12:45:34,831 INFO L119 BuchiIsEmpty]: Starting construction of run 121.63/79.33 [2019-03-28 12:45:34,832 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.33 [2019-03-28 12:45:34,832 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.33 [2019-03-28 12:45:34,832 INFO L794 eck$LassoCheckResult]: Stem: 4080#ULTIMATE.startENTRY [88] 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] 4074#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4075#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4070#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 4101#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 4100#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 4099#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 4093#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 4091#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 4089#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4086#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 4076#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4077#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 4057#L15 121.63/79.33 [2019-03-28 12:45:34,833 INFO L796 eck$LassoCheckResult]: Loop: 4057#L15 [227] L15-->L16: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 4058#L16 [96] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 4055#L16-1 [229] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_29| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 4056#L17 [113] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~d~0.base_10) v_ULTIMATE.start_main_~d~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~d~0.base_10)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~d~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 4059#L17-1 [231] L17-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_main_~d~0.base_17)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17) v_ULTIMATE.start_main_~d~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem13_6| (- 1)))) |v_#memory_int_25|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~d~0.base_17))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 4060#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4073#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 4067#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 4065#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 4061#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 4062#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 4098#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 4097#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4096#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 4095#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4094#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 4057#L15 121.63/79.33 [2019-03-28 12:45:34,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:34,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2086401323, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:34,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:34,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:34,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash -599343318, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:34,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:34,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:34,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:34,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.33 [2019-03-28 12:45:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash 121807358, now seen corresponding path program 1 times 121.63/79.33 [2019-03-28 12:45:34,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.33 [2019-03-28 12:45:34,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.33 [2019-03-28 12:45:34,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.33 [2019-03-28 12:45:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.33 [2019-03-28 12:45:34,990 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 77 121.63/79.33 [2019-03-28 12:45:35,327 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 121.63/79.33 [2019-03-28 12:45:35,413 INFO L216 LassoAnalysis]: Preferences: 121.63/79.33 [2019-03-28 12:45:35,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.63/79.33 [2019-03-28 12:45:35,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.63/79.33 [2019-03-28 12:45:35,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.63/79.33 [2019-03-28 12:45:35,414 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.63/79.33 [2019-03-28 12:45:35,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.63/79.33 [2019-03-28 12:45:35,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.63/79.33 [2019-03-28 12:45:35,414 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.63/79.33 [2019-03-28 12:45:35,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Lasso 121.63/79.33 [2019-03-28 12:45:35,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.63/79.33 [2019-03-28 12:45:35,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.63/79.33 [2019-03-28 12:45:35,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,666 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 121.63/79.33 [2019-03-28 12:45:35,780 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 121.63/79.33 [2019-03-28 12:45:35,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:35,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.33 [2019-03-28 12:45:36,187 INFO L300 LassoAnalysis]: Preprocessing complete. 121.63/79.33 [2019-03-28 12:45:36,188 INFO L497 LassoAnalysis]: Using template 'affine'. 121.63/79.33 [2019-03-28 12:45:36,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:36,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:36,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:36,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:36,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:36,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:36,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:36,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:36,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.33 Simplify termination arguments: true 121.63/79.33 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.33 [2019-03-28 12:45:36,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.33 [2019-03-28 12:45:36,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.33 [2019-03-28 12:45:36,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.33 [2019-03-28 12:45:36,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.33 [2019-03-28 12:45:36,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.33 [2019-03-28 12:45:36,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.33 [2019-03-28 12:45:36,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.33 [2019-03-28 12:45:36,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.33 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.33 Number of strict supporting invariants: 0 121.63/79.33 Number of non-strict supporting invariants: 1 121.63/79.33 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:45:36,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:45:36,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:45:36,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:45:36,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:45:36,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:45:36,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:45:36,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.34 [2019-03-28 12:45:36,210 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 121.63/79.34 [2019-03-28 12:45:36,211 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. 121.63/79.34 [2019-03-28 12:45:36,212 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.34 [2019-03-28 12:45:36,213 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 121.63/79.34 [2019-03-28 12:45:36,213 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.34 [2019-03-28 12:45:36,213 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.34 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_9 121.63/79.34 Supporting invariants [] 121.63/79.34 [2019-03-28 12:45:36,288 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.63/79.34 [2019-03-28 12:45:36,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.34 [2019-03-28 12:45:36,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:45:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:45:36,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:45:36,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:45:36,342 INFO L189 IndexEqualityManager]: detected not equals via solver 121.63/79.34 [2019-03-28 12:45:36,347 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 121.63/79.34 [2019-03-28 12:45:36,347 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:36,356 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:45:36,356 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:36,357 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 121.63/79.34 [2019-03-28 12:45:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:45:36,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:45:36,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:45:36,387 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 19 treesize of output 18 121.63/79.34 [2019-03-28 12:45:36,387 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:36,393 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:45:36,393 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:36,393 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.63/79.34 [2019-03-28 12:45:36,438 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:45:36,439 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 28 treesize of output 61 121.63/79.34 [2019-03-28 12:45:36,445 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:36,496 INFO L497 ElimStorePlain]: treesize reduction 35, result has 53.9 percent of original size 121.63/79.34 [2019-03-28 12:45:36,497 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:36,498 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:31 121.63/79.34 [2019-03-28 12:45:42,164 WARN L188 SmtUtils]: Spent 2.82 s on a formula simplification that was a NOOP. DAG size: 23 121.63/79.34 [2019-03-28 12:45:43,641 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 28 treesize of output 16 121.63/79.34 [2019-03-28 12:45:43,642 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:43,648 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:45:43,649 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:43,649 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.34 [2019-03-28 12:45:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.63/79.34 [2019-03-28 12:45:45,183 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~y~0.base Int) (ULTIMATE.start_main_~y~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~d~0.offset ULTIMATE.start_main_~y~0.offset) (= c_ULTIMATE.start_main_~d~0.base ULTIMATE.start_main_~y~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~d~0.base) c_ULTIMATE.start_main_~d~0.offset) 1) c_oldRank0)) is different from true 121.63/79.34 [2019-03-28 12:45:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:45:45,253 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.34 [2019-03-28 12:45:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:45:45,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:45:45,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:45:45,269 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 28 treesize of output 16 121.63/79.34 [2019-03-28 12:45:45,269 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:45,275 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:45:45,275 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:45,275 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.34 [2019-03-28 12:45:45,281 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 28 treesize of output 23 121.63/79.34 [2019-03-28 12:45:45,282 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:45,288 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:45:45,289 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:45,289 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 121.63/79.34 [2019-03-28 12:45:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:45:45,326 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.34 [2019-03-28 12:45:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:45:45,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:45:45,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:45:48,254 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 26 treesize of output 21 121.63/79.34 [2019-03-28 12:45:48,255 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:48,262 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:45:48,262 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:48,262 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 121.63/79.34 [2019-03-28 12:45:49,776 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:45:49,791 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 35 treesize of output 64 121.63/79.34 [2019-03-28 12:45:49,795 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:49,850 INFO L497 ElimStorePlain]: treesize reduction 39, result has 57.1 percent of original size 121.63/79.34 [2019-03-28 12:45:49,851 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 121.63/79.34 [2019-03-28 12:45:49,851 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 121.63/79.34 [2019-03-28 12:45:55,704 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 26 121.63/79.34 [2019-03-28 12:46:00,095 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 c_oldRank0) (exists ((ULTIMATE.start_main_~y~0.base Int) (ULTIMATE.start_main_~y~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~d~0.offset ULTIMATE.start_main_~y~0.offset) (= c_ULTIMATE.start_main_~d~0.base ULTIMATE.start_main_~y~0.base))))) is different from true 121.63/79.34 [2019-03-28 12:46:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:00,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:00,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:00,176 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 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:00,177 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,184 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:00,184 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,184 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 121.63/79.34 [2019-03-28 12:46:00,207 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:00,207 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 35 treesize of output 64 121.63/79.34 [2019-03-28 12:46:00,211 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,269 INFO L497 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size 121.63/79.34 [2019-03-28 12:46:00,270 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,270 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 121.63/79.34 [2019-03-28 12:46:00,281 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 37 treesize of output 25 121.63/79.34 [2019-03-28 12:46:00,282 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,286 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 39 treesize of output 23 121.63/79.34 [2019-03-28 12:46:00,287 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,306 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size 121.63/79.34 [2019-03-28 12:46:00,306 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,306 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 121.63/79.34 [2019-03-28 12:46:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:00,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:00,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:00,385 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 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:00,385 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,392 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:00,393 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,393 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 121.63/79.34 [2019-03-28 12:46:00,418 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:00,418 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 35 treesize of output 64 121.63/79.34 [2019-03-28 12:46:00,422 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,480 INFO L497 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size 121.63/79.34 [2019-03-28 12:46:00,481 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,482 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 121.63/79.34 [2019-03-28 12:46:00,493 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 39 treesize of output 23 121.63/79.34 [2019-03-28 12:46:00,494 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,499 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 37 treesize of output 25 121.63/79.34 [2019-03-28 12:46:00,500 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,520 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size 121.63/79.34 [2019-03-28 12:46:00,520 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:00,521 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 121.63/79.34 [2019-03-28 12:46:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:00,557 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.34 [2019-03-28 12:46:00,557 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 13 predicates after loop cannibalization 121.63/79.34 [2019-03-28 12:46:00,557 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 13 loop predicates 121.63/79.34 [2019-03-28 12:46:00,557 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand 10 states. 121.63/79.34 [2019-03-28 12:46:19,033 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states and 59 transitions. cyclomatic complexity: 14. Second operand 10 states. Result 650 states and 697 transitions. Complement of second has 295 states. 121.63/79.34 [2019-03-28 12:46:19,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 3 stem states 17 non-accepting loop states 2 accepting loop states 121.63/79.34 [2019-03-28 12:46:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 121.63/79.34 [2019-03-28 12:46:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. 121.63/79.34 [2019-03-28 12:46:19,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 110 transitions. Stem has 13 letters. Loop has 16 letters. 121.63/79.34 [2019-03-28 12:46:19,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:19,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 110 transitions. Stem has 29 letters. Loop has 16 letters. 121.63/79.34 [2019-03-28 12:46:19,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:19,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 110 transitions. Stem has 13 letters. Loop has 32 letters. 121.63/79.34 [2019-03-28 12:46:19,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:19,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 697 transitions. 121.63/79.34 [2019-03-28 12:46:19,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 116 121.63/79.34 [2019-03-28 12:46:19,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 258 states and 287 transitions. 121.63/79.34 [2019-03-28 12:46:19,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 121.63/79.34 [2019-03-28 12:46:19,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 121.63/79.34 [2019-03-28 12:46:19,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 287 transitions. 121.63/79.34 [2019-03-28 12:46:19,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.63/79.34 [2019-03-28 12:46:19,049 INFO L706 BuchiCegarLoop]: Abstraction has 258 states and 287 transitions. 121.63/79.34 [2019-03-28 12:46:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 287 transitions. 121.63/79.34 [2019-03-28 12:46:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 83. 121.63/79.34 [2019-03-28 12:46:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. 121.63/79.34 [2019-03-28 12:46:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. 121.63/79.34 [2019-03-28 12:46:19,053 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 98 transitions. 121.63/79.34 [2019-03-28 12:46:19,053 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 98 transitions. 121.63/79.34 [2019-03-28 12:46:19,053 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 121.63/79.34 [2019-03-28 12:46:19,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 98 transitions. 121.63/79.34 [2019-03-28 12:46:19,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 121.63/79.34 [2019-03-28 12:46:19,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.63/79.34 [2019-03-28 12:46:19,054 INFO L119 BuchiIsEmpty]: Starting construction of run 121.63/79.34 [2019-03-28 12:46:19,055 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.34 [2019-03-28 12:46:19,055 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.34 [2019-03-28 12:46:19,056 INFO L794 eck$LassoCheckResult]: Stem: 5517#ULTIMATE.startENTRY [88] 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] 5515#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5516#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5542#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5558#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 5557#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5554#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5555#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5550#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 5551#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5546#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5547#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5543#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 5488#L15 121.63/79.34 [2019-03-28 12:46:19,056 INFO L796 eck$LassoCheckResult]: Loop: 5488#L15 [227] L15-->L16: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 5489#L16 [96] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 5492#L16-1 [229] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_29| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 5493#L17 [113] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~d~0.base_10) v_ULTIMATE.start_main_~d~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~d~0.base_10)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~d~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 5494#L17-1 [231] L17-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_main_~d~0.base_17)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17) v_ULTIMATE.start_main_~d~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem13_6| (- 1)))) |v_#memory_int_25|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~d~0.base_17))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 5495#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5507#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5570#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 5569#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5568#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5567#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5565#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 5563#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5561#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5559#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5512#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 5518#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 5519#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5520#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 5505#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5506#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5503#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 5500#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5501#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 5552#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5553#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 5548#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5549#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5544#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5545#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 5488#L15 121.63/79.34 [2019-03-28 12:46:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2086401323, now seen corresponding path program 2 times 121.63/79.34 [2019-03-28 12:46:19,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:19,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash 513642251, now seen corresponding path program 1 times 121.63/79.34 [2019-03-28 12:46:19,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:19,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:19,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash 333049567, now seen corresponding path program 1 times 121.63/79.34 [2019-03-28 12:46:19,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:19,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:19,688 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 121.63/79.34 [2019-03-28 12:46:20,077 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 121.63/79.34 [2019-03-28 12:46:20,161 INFO L216 LassoAnalysis]: Preferences: 121.63/79.34 [2019-03-28 12:46:20,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.63/79.34 [2019-03-28 12:46:20,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.63/79.34 [2019-03-28 12:46:20,161 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.63/79.34 [2019-03-28 12:46:20,162 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.63/79.34 [2019-03-28 12:46:20,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.63/79.34 [2019-03-28 12:46:20,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.63/79.34 [2019-03-28 12:46:20,162 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.63/79.34 [2019-03-28 12:46:20,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Lasso 121.63/79.34 [2019-03-28 12:46:20,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.63/79.34 [2019-03-28 12:46:20,162 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.63/79.34 [2019-03-28 12:46:20,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,381 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 121.63/79.34 [2019-03-28 12:46:20,505 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 121.63/79.34 [2019-03-28 12:46:20,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:20,840 INFO L300 LassoAnalysis]: Preprocessing complete. 121.63/79.34 [2019-03-28 12:46:20,840 INFO L497 LassoAnalysis]: Using template 'affine'. 121.63/79.34 [2019-03-28 12:46:20,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:20,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:20,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:20,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:20,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:20,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:20,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:20,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:20,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:20,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:20,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.34 [2019-03-28 12:46:20,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:20,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:20,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:20,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:20,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:20,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:20,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:20,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:20,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:20,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:20,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:20,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:20,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:20,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:20,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:20,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:20,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:20,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:20,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:20,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:20,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:20,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:20,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:20,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:20,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:20,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:20,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:20,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:20,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:20,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:20,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:20,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:20,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:20,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:20,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:20,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:20,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:20,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:20,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:20,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:20,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:20,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:20,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:20,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:20,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:20,866 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.34 [2019-03-28 12:46:20,869 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.63/79.34 [2019-03-28 12:46:20,870 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 121.63/79.34 [2019-03-28 12:46:20,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.34 [2019-03-28 12:46:20,871 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 121.63/79.34 [2019-03-28 12:46:20,871 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.34 [2019-03-28 12:46:20,871 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.34 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 121.63/79.34 Supporting invariants [] 121.63/79.34 [2019-03-28 12:46:20,955 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed 121.63/79.34 [2019-03-28 12:46:20,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.34 [2019-03-28 12:46:20,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:20,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:20,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:21,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:21,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:21,027 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:21,028 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,034 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,035 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,035 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:21,058 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:21,059 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,065 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,066 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,066 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:21,084 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:21,084 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,091 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,092 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,092 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:21,133 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 121.63/79.34 [2019-03-28 12:46:21,134 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,145 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,145 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,146 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 121.63/79.34 [2019-03-28 12:46:21,150 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:21,151 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,160 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,160 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,161 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 121.63/79.34 [2019-03-28 12:46:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 121.63/79.34 [2019-03-28 12:46:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:21,302 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.34 [2019-03-28 12:46:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:21,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:21,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:21,323 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:21,323 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,331 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,331 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,331 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:21,387 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:21,388 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,397 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,397 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,397 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,401 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,401 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,410 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,410 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,410 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,416 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,417 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,428 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,428 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,428 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:21,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:21,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:21,490 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:21,491 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,500 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,501 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,501 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:21,520 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:21,521 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,532 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,533 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,533 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,538 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,539 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,549 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,550 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,550 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,556 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,557 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,568 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,569 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,569 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,574 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:21,575 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,596 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,597 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,597 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:21,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:21,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:21,682 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:21,682 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,694 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,695 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,695 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,701 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,702 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,712 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,713 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,713 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,721 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,721 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,732 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,733 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,733 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,741 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:21,741 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,752 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,753 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,753 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:21,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:21,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:21,786 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:21,787 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,798 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,799 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,799 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,808 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,809 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,820 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,820 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,820 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,830 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,831 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,842 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,843 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,843 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,854 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:21,855 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,866 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,867 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,867 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:21,874 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:21,874 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,886 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,887 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,887 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:21,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:21,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:21,912 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:21,913 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,921 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,921 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,921 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:21,930 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:21,930 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,938 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,938 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,938 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:21,949 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:21,950 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,959 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,959 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,959 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:21,964 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:21,964 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,973 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,974 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,974 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:21,979 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:21,980 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,989 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:21,989 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:21,990 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:22,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:22,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:22,015 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:22,015 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,025 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,025 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,025 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,035 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:22,035 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,043 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,043 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,044 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,054 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:22,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,064 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,064 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,064 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,075 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:22,075 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,084 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,085 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,085 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:22,090 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,091 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,100 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,101 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,101 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:22,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:22,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:22,132 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:22,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,142 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,142 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,142 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,153 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:22,153 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,162 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,163 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,163 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,175 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:22,175 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,184 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,185 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,185 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:22,197 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,206 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,206 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,207 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:22,213 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,213 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,224 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,225 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,225 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:22,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:22,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:22,260 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:22,260 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,269 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,270 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,270 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,283 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:22,284 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,295 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,296 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,296 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:22,302 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:22,302 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,313 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,314 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,314 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,320 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,321 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,332 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,333 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,333 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:22,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:22,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:22,367 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:22,367 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,377 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,377 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,377 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:22,382 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:22,382 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,391 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,391 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,392 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,397 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,397 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,407 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,408 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,408 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,414 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,415 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,424 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,424 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,425 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:22,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:22,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:22,450 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:22,450 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,460 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,460 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,461 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:22,465 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:22,466 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,475 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,475 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,475 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,480 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,481 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,493 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,493 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,493 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,499 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,500 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,509 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,510 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,510 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,514 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:22,515 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,524 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,524 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,524 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 121.63/79.34 [2019-03-28 12:46:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:22,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:22,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:22,549 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:22,549 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,558 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,559 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,559 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:22,571 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,580 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,581 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,581 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:22,586 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,586 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,596 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,596 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,596 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:22,603 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 121.63/79.34 [2019-03-28 12:46:22,603 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,613 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,613 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,613 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 121.63/79.34 [2019-03-28 12:46:22,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:22,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,629 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,630 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,630 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 121.63/79.34 [2019-03-28 12:46:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:22,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:22,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:22,659 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:22,660 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,668 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,669 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,669 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:22,679 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:22,679 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,686 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,687 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,687 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:22,692 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:22,693 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,701 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,702 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,702 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:22,709 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 121.63/79.34 [2019-03-28 12:46:22,709 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,722 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,723 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,723 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 121.63/79.34 [2019-03-28 12:46:22,731 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:22,731 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,776 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:22,776 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:22,776 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 121.63/79.34 [2019-03-28 12:46:22,779 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization 121.63/79.34 [2019-03-28 12:46:22,779 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 8 loop predicates 121.63/79.34 [2019-03-28 12:46:22,780 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 83 states and 98 transitions. cyclomatic complexity: 17 Second operand 8 states. 121.63/79.34 [2019-03-28 12:46:24,157 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 83 states and 98 transitions. cyclomatic complexity: 17. Second operand 8 states. Result 902 states and 991 transitions. Complement of second has 92 states. 121.63/79.34 [2019-03-28 12:46:24,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 34 states 8 stem states 21 non-accepting loop states 5 accepting loop states 121.63/79.34 [2019-03-28 12:46:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 121.63/79.34 [2019-03-28 12:46:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 270 transitions. 121.63/79.34 [2019-03-28 12:46:24,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 270 transitions. Stem has 13 letters. Loop has 30 letters. 121.63/79.34 [2019-03-28 12:46:24,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:24,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 270 transitions. Stem has 43 letters. Loop has 30 letters. 121.63/79.34 [2019-03-28 12:46:24,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:24,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 270 transitions. Stem has 13 letters. Loop has 60 letters. 121.63/79.34 [2019-03-28 12:46:24,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:24,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 902 states and 991 transitions. 121.63/79.34 [2019-03-28 12:46:24,200 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 399 121.63/79.34 [2019-03-28 12:46:24,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 902 states to 705 states and 781 transitions. 121.63/79.34 [2019-03-28 12:46:24,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 121.63/79.34 [2019-03-28 12:46:24,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 121.63/79.34 [2019-03-28 12:46:24,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 781 transitions. 121.63/79.34 [2019-03-28 12:46:24,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.63/79.34 [2019-03-28 12:46:24,206 INFO L706 BuchiCegarLoop]: Abstraction has 705 states and 781 transitions. 121.63/79.34 [2019-03-28 12:46:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 781 transitions. 121.63/79.34 [2019-03-28 12:46:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 190. 121.63/79.34 [2019-03-28 12:46:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. 121.63/79.34 [2019-03-28 12:46:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. 121.63/79.34 [2019-03-28 12:46:24,215 INFO L729 BuchiCegarLoop]: Abstraction has 190 states and 217 transitions. 121.63/79.34 [2019-03-28 12:46:24,215 INFO L609 BuchiCegarLoop]: Abstraction has 190 states and 217 transitions. 121.63/79.34 [2019-03-28 12:46:24,215 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 121.63/79.34 [2019-03-28 12:46:24,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 217 transitions. 121.63/79.34 [2019-03-28 12:46:24,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 121.63/79.34 [2019-03-28 12:46:24,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.63/79.34 [2019-03-28 12:46:24,217 INFO L119 BuchiIsEmpty]: Starting construction of run 121.63/79.34 [2019-03-28 12:46:24,217 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.34 [2019-03-28 12:46:24,217 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.34 [2019-03-28 12:46:24,218 INFO L794 eck$LassoCheckResult]: Stem: 7966#ULTIMATE.startENTRY [88] 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] 7963#L-1 [168] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 7964#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 7956#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 7953#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 7951#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 7946#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 7947#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8107#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 7975#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 7972#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 7959#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 7960#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 7936#L15 121.63/79.34 [2019-03-28 12:46:24,219 INFO L796 eck$LassoCheckResult]: Loop: 7936#L15 [227] L15-->L16: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 7937#L16 [96] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 7940#L16-1 [229] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_29| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 7941#L17 [113] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~d~0.base_10) v_ULTIMATE.start_main_~d~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~d~0.base_10)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~d~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 8121#L17-1 [231] L17-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_main_~d~0.base_17)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17) v_ULTIMATE.start_main_~d~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem13_6| (- 1)))) |v_#memory_int_25|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~d~0.base_17))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 8119#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 8117#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 8115#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 8113#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 8111#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 8109#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8108#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 8105#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 8103#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8100#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 8075#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 7974#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 7968#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 7969#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 8086#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 8085#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 8084#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 8083#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 8082#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 8081#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8080#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 8079#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 8078#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 8077#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 8076#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 7936#L15 121.63/79.34 [2019-03-28 12:46:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2079483254, now seen corresponding path program 1 times 121.63/79.34 [2019-03-28 12:46:24,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:24,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:24,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 513642251, now seen corresponding path program 2 times 121.63/79.34 [2019-03-28 12:46:24,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:24,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 208976320, now seen corresponding path program 1 times 121.63/79.34 [2019-03-28 12:46:24,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:24,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:24,829 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 121.63/79.34 [2019-03-28 12:46:24,952 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 69 121.63/79.34 [2019-03-28 12:46:25,283 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 121.63/79.34 [2019-03-28 12:46:25,389 INFO L216 LassoAnalysis]: Preferences: 121.63/79.34 [2019-03-28 12:46:25,390 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.63/79.34 [2019-03-28 12:46:25,390 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.63/79.34 [2019-03-28 12:46:25,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.63/79.34 [2019-03-28 12:46:25,390 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.63/79.34 [2019-03-28 12:46:25,390 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.63/79.34 [2019-03-28 12:46:25,390 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.63/79.34 [2019-03-28 12:46:25,390 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.63/79.34 [2019-03-28 12:46:25,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso 121.63/79.34 [2019-03-28 12:46:25,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.63/79.34 [2019-03-28 12:46:25,391 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.63/79.34 [2019-03-28 12:46:25,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,619 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 121.63/79.34 [2019-03-28 12:46:25,745 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 121.63/79.34 [2019-03-28 12:46:25,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:25,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:26,101 INFO L300 LassoAnalysis]: Preprocessing complete. 121.63/79.34 [2019-03-28 12:46:26,101 INFO L497 LassoAnalysis]: Using template 'affine'. 121.63/79.34 [2019-03-28 12:46:26,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:26,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:26,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:26,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:26,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:26,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:26,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:26,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:26,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:26,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:26,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:26,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:26,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:26,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:26,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:26,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:26,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:26,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:26,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:26,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:26,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:26,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:26,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:26,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:26,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:26,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:26,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:26,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:26,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:26,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:26,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:26,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:26,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:26,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:26,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:26,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:26,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:26,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:26,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:26,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:26,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:26,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:26,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:26,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:26,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:26,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:26,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:26,131 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.34 [2019-03-28 12:46:26,134 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.63/79.34 [2019-03-28 12:46:26,134 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 121.63/79.34 [2019-03-28 12:46:26,134 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.34 [2019-03-28 12:46:26,135 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 121.63/79.34 [2019-03-28 12:46:26,135 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.34 [2019-03-28 12:46:26,135 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.34 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_11) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_11 121.63/79.34 Supporting invariants [] 121.63/79.34 [2019-03-28 12:46:26,232 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed 121.63/79.34 [2019-03-28 12:46:26,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.34 [2019-03-28 12:46:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:26,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:26,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:26,284 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,284 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 27 121.63/79.34 [2019-03-28 12:46:26,284 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,290 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,290 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,291 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 121.63/79.34 [2019-03-28 12:46:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:26,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:26,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:26,326 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:26,327 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,334 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,335 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,335 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:26,360 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:26,361 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,368 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,369 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,369 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:26,388 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:26,388 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,397 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,398 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,398 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:26,454 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 121.63/79.34 [2019-03-28 12:46:26,455 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,465 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,465 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,466 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 121.63/79.34 [2019-03-28 12:46:26,470 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:26,471 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,480 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,480 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,480 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 121.63/79.34 [2019-03-28 12:46:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 121.63/79.34 [2019-03-28 12:46:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:26,598 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.34 [2019-03-28 12:46:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:26,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:26,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:26,620 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:26,620 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,628 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,629 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,629 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:26,684 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:26,684 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,693 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,693 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,694 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,697 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:26,698 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,706 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,706 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,706 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,711 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:26,712 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,720 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,720 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,721 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:26,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:26,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:26,766 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:26,766 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,774 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,774 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,774 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:26,785 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:26,785 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,794 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,794 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,794 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,798 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:26,799 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,807 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,808 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,808 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,814 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:26,814 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,825 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,826 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,826 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,831 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:26,832 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,841 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,841 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,842 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:26,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:26,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:26,929 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:26,930 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,938 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,939 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,943 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:26,943 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,951 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,951 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,952 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,956 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:26,957 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,965 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,965 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,965 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:26,969 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:26,969 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,977 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:26,978 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:26,978 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:26,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:26,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,002 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:27,003 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,012 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,013 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,013 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 121.63/79.34 [2019-03-28 12:46:27,018 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:27,018 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,027 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,027 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,028 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:27,033 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:27,033 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,044 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,044 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,045 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:27,049 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:27,049 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,058 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,059 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,059 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,064 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,064 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,074 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,074 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,074 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:27,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:27,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,099 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:27,100 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,108 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,109 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,109 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,118 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:27,119 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,126 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,126 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,126 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,138 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:27,138 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,150 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,150 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,150 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:27,156 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:27,156 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,167 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,168 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,168 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,173 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,174 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,185 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,185 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,186 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:27,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:27,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,213 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:27,213 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,221 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,222 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,222 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,231 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:27,231 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,239 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,239 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,239 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,250 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:27,251 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,259 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,260 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,260 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,269 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:27,270 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,277 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,278 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,278 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:27,282 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,283 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,291 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,291 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,291 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:27,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:27,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,315 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:27,316 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,323 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,324 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,324 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,333 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:27,333 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,341 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,341 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,341 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,351 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:27,352 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,359 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,359 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,359 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,368 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:27,369 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,376 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,376 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,376 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:27,381 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,381 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,389 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,389 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,390 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:27,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:27,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,418 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:27,418 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,426 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,426 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,426 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,437 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:27,437 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,446 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,447 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,447 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:27,451 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:27,452 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,462 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,463 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,463 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,468 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,469 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,480 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,480 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,481 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:27,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:27,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,513 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:27,513 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,524 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,524 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,525 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:27,530 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:27,530 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,541 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,541 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,541 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,546 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,547 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,558 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,558 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,559 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,565 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,566 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,577 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,578 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,578 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:27,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:27,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,612 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 121.63/79.34 [2019-03-28 12:46:27,613 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,623 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,624 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,624 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 121.63/79.34 [2019-03-28 12:46:27,630 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:27,630 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,641 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,641 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,642 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,647 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,647 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,658 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,659 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,659 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,666 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,666 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,677 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,678 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,678 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,683 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 121.63/79.34 [2019-03-28 12:46:27,683 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,694 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,694 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,694 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 121.63/79.34 [2019-03-28 12:46:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:27,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:27,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,726 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:27,726 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,735 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,736 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,736 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,747 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:27,748 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,757 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,757 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,757 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:27,762 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,763 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,772 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,773 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,773 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:27,780 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 121.63/79.34 [2019-03-28 12:46:27,781 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,792 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,793 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,793 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 121.63/79.34 [2019-03-28 12:46:27,798 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:27,798 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,809 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,809 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,810 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 121.63/79.34 [2019-03-28 12:46:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:27,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:27,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:27,839 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:27,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,848 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,849 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,849 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 121.63/79.34 [2019-03-28 12:46:27,862 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:27,862 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,872 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,873 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,873 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 121.63/79.34 [2019-03-28 12:46:27,879 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 121.63/79.34 [2019-03-28 12:46:27,880 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,889 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,890 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,890 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 121.63/79.34 [2019-03-28 12:46:27,897 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 121.63/79.34 [2019-03-28 12:46:27,897 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,909 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,910 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,910 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 121.63/79.34 [2019-03-28 12:46:27,915 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 121.63/79.34 [2019-03-28 12:46:27,916 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,926 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:27,927 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:27,927 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 121.63/79.34 [2019-03-28 12:46:27,930 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization 121.63/79.34 [2019-03-28 12:46:27,930 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 8 loop predicates 121.63/79.34 [2019-03-28 12:46:27,930 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 190 states and 217 transitions. cyclomatic complexity: 32 Second operand 8 states. 121.63/79.34 [2019-03-28 12:46:28,384 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 190 states and 217 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 451 states and 496 transitions. Complement of second has 39 states. 121.63/79.34 [2019-03-28 12:46:28,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states 121.63/79.34 [2019-03-28 12:46:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 121.63/79.34 [2019-03-28 12:46:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. 121.63/79.34 [2019-03-28 12:46:28,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 13 letters. Loop has 30 letters. 121.63/79.34 [2019-03-28 12:46:28,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:28,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 43 letters. Loop has 30 letters. 121.63/79.34 [2019-03-28 12:46:28,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:28,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 13 letters. Loop has 60 letters. 121.63/79.34 [2019-03-28 12:46:28,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.34 [2019-03-28 12:46:28,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 451 states and 496 transitions. 121.63/79.34 [2019-03-28 12:46:28,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 121.63/79.34 [2019-03-28 12:46:28,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 451 states to 246 states and 278 transitions. 121.63/79.34 [2019-03-28 12:46:28,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 121.63/79.34 [2019-03-28 12:46:28,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 121.63/79.34 [2019-03-28 12:46:28,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 278 transitions. 121.63/79.34 [2019-03-28 12:46:28,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 121.63/79.34 [2019-03-28 12:46:28,399 INFO L706 BuchiCegarLoop]: Abstraction has 246 states and 278 transitions. 121.63/79.34 [2019-03-28 12:46:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 278 transitions. 121.63/79.34 [2019-03-28 12:46:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 109. 121.63/79.34 [2019-03-28 12:46:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. 121.63/79.34 [2019-03-28 12:46:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. 121.63/79.34 [2019-03-28 12:46:28,403 INFO L729 BuchiCegarLoop]: Abstraction has 109 states and 128 transitions. 121.63/79.34 [2019-03-28 12:46:28,403 INFO L609 BuchiCegarLoop]: Abstraction has 109 states and 128 transitions. 121.63/79.34 [2019-03-28 12:46:28,403 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 121.63/79.34 [2019-03-28 12:46:28,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 128 transitions. 121.63/79.34 [2019-03-28 12:46:28,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 121.63/79.34 [2019-03-28 12:46:28,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 121.63/79.34 [2019-03-28 12:46:28,404 INFO L119 BuchiIsEmpty]: Starting construction of run 121.63/79.34 [2019-03-28 12:46:28,404 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.34 [2019-03-28 12:46:28,405 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 121.63/79.34 [2019-03-28 12:46:28,405 INFO L794 eck$LassoCheckResult]: Stem: 9966#ULTIMATE.startENTRY [88] 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] 9964#L-1 [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 9965#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9991#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9990#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 9989#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 9988#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9987#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9986#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 9985#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 9984#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9983#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 9982#L11 [90] L11-->L15: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet8_5|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 9937#L15 [227] L15-->L16: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 9938#L16 [96] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 9997#L16-1 [229] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_29| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 9952#L17 [113] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~d~0.base_10) v_ULTIMATE.start_main_~d~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~d~0.base_10)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~d~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_10, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 9946#L17-1 [231] L17-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_main_~d~0.base_17)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~d~0.base_17) v_ULTIMATE.start_main_~d~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem13_6| (- 1)))) |v_#memory_int_25|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~d~0.base_17))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_13, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_17, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 9947#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9959#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9957#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 9954#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 9955#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 10030#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9979#L10-7 121.63/79.34 [2019-03-28 12:46:28,406 INFO L796 eck$LassoCheckResult]: Loop: 9979#L10-7 [132] L10-7-->L10-8: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 9975#L10-8 [126] L10-8-->L10-9: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~d~0.base_4)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 9973#L10-9 [188] L10-9-->L10-11: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9960#L10-11 [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 9961#L11 [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 9967#L12 [104] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 9969#L12-1 [228] L12-1-->L13: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 9970#L13 [230] L13-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12) (= (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16) 1) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 9945#L11-2 [80] L11-2-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9958#L10-1 [175] L10-1-->L10-2: Formula: (and |v_ULTIMATE.start_main_#t~short5_2| (< 0 |v_ULTIMATE.start_main_#t~mem3_3|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9956#L10-2 [119] L10-2-->L10-3: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 9953#L10-3 [116] L10-3-->L10-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem4_2|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 9948#L10-4 [183] L10-4-->L10-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short5_4|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 9949#L10-6 [181] L10-6-->L10-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 9979#L10-7 121.63/79.34 [2019-03-28 12:46:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1361998371, now seen corresponding path program 2 times 121.63/79.34 [2019-03-28 12:46:28,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:28,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1927426560, now seen corresponding path program 9 times 121.63/79.34 [2019-03-28 12:46:28,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:28,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:28,435 INFO L82 PathProgramCache]: Analyzing trace with hash -633283422, now seen corresponding path program 2 times 121.63/79.34 [2019-03-28 12:46:28,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 121.63/79.34 [2019-03-28 12:46:28,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 121.63/79.34 [2019-03-28 12:46:28,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 121.63/79.34 [2019-03-28 12:46:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:29,100 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 121.63/79.34 [2019-03-28 12:46:29,244 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 88 121.63/79.34 [2019-03-28 12:46:29,248 INFO L216 LassoAnalysis]: Preferences: 121.63/79.34 [2019-03-28 12:46:29,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 121.63/79.34 [2019-03-28 12:46:29,273 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 121.63/79.34 [2019-03-28 12:46:29,273 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 121.63/79.34 [2019-03-28 12:46:29,273 INFO L127 ssoRankerPreferences]: Use exernal solver: false 121.63/79.34 [2019-03-28 12:46:29,273 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 121.63/79.34 [2019-03-28 12:46:29,273 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 121.63/79.34 [2019-03-28 12:46:29,273 INFO L130 ssoRankerPreferences]: Path of dumped script: 121.63/79.34 [2019-03-28 12:46:29,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Lasso 121.63/79.34 [2019-03-28 12:46:29,274 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 121.63/79.34 [2019-03-28 12:46:29,274 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 121.63/79.34 [2019-03-28 12:46:29,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,545 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 121.63/79.34 [2019-03-28 12:46:29,663 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 121.63/79.34 [2019-03-28 12:46:29,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:29,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 121.63/79.34 [2019-03-28 12:46:30,021 INFO L300 LassoAnalysis]: Preprocessing complete. 121.63/79.34 [2019-03-28 12:46:30,021 INFO L497 LassoAnalysis]: Using template 'affine'. 121.63/79.34 [2019-03-28 12:46:30,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.34 [2019-03-28 12:46:30,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.34 [2019-03-28 12:46:30,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.34 [2019-03-28 12:46:30,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 121.63/79.34 [2019-03-28 12:46:30,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 121.63/79.34 [2019-03-28 12:46:30,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 121.63/79.34 Termination analysis: LINEAR_WITH_GUESSES 121.63/79.34 Number of strict supporting invariants: 0 121.63/79.34 Number of non-strict supporting invariants: 1 121.63/79.34 Consider only non-deceasing supporting invariants: true 121.63/79.34 Simplify termination arguments: true 121.63/79.34 Simplify supporting invariants: trueOverapproximate stem: false 121.63/79.34 [2019-03-28 12:46:30,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. 121.63/79.34 [2019-03-28 12:46:30,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 121.63/79.34 [2019-03-28 12:46:30,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 121.63/79.34 [2019-03-28 12:46:30,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 121.63/79.34 [2019-03-28 12:46:30,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 121.63/79.34 [2019-03-28 12:46:30,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 121.63/79.34 [2019-03-28 12:46:30,094 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 121.63/79.34 [2019-03-28 12:46:30,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 121.63/79.34 [2019-03-28 12:46:30,097 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. 121.63/79.34 [2019-03-28 12:46:30,098 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 121.63/79.34 [2019-03-28 12:46:30,098 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 121.63/79.34 [2019-03-28 12:46:30,098 INFO L518 LassoAnalysis]: Proved termination. 121.63/79.34 [2019-03-28 12:46:30,099 INFO L520 LassoAnalysis]: Termination argument consisting of: 121.63/79.34 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_12) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_12 121.63/79.34 Supporting invariants [] 121.63/79.34 [2019-03-28 12:46:30,174 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 121.63/79.34 [2019-03-28 12:46:30,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 121.63/79.34 [2019-03-28 12:46:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 121.63/79.34 [2019-03-28 12:46:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:30,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:30,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:30,232 INFO L189 IndexEqualityManager]: detected not equals via solver 121.63/79.34 [2019-03-28 12:46:30,234 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 121.63/79.34 [2019-03-28 12:46:30,235 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,242 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:30,243 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,243 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 121.63/79.34 [2019-03-28 12:46:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:30,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:30,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:30,290 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 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:30,291 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,297 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:30,297 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,297 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.34 [2019-03-28 12:46:30,314 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 121.63/79.34 [2019-03-28 12:46:30,315 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,321 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:30,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,321 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.34 [2019-03-28 12:46:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 121.63/79.34 [2019-03-28 12:46:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:30,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:30,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:30,437 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 28 treesize of output 16 121.63/79.34 [2019-03-28 12:46:30,437 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,443 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:30,443 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,443 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.34 [2019-03-28 12:46:30,446 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 121.63/79.34 [2019-03-28 12:46:30,447 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,453 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:30,453 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,453 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.34 [2019-03-28 12:46:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.34 [2019-03-28 12:46:30,464 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.34 [2019-03-28 12:46:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:30,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:30,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:30,477 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 19 treesize of output 18 121.63/79.34 [2019-03-28 12:46:30,478 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,483 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:30,483 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,483 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 121.63/79.34 [2019-03-28 12:46:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.34 [2019-03-28 12:46:30,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.34 [2019-03-28 12:46:30,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.34 [2019-03-28 12:46:30,568 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 35 treesize of output 19 121.63/79.34 [2019-03-28 12:46:30,569 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.34 [2019-03-28 12:46:30,575 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.34 [2019-03-28 12:46:30,575 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.35 [2019-03-28 12:46:30,576 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 121.63/79.35 [2019-03-28 12:46:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 121.63/79.35 [2019-03-28 12:46:30,622 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 121.63/79.35 [2019-03-28 12:46:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 121.63/79.35 [2019-03-28 12:46:30,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 121.63/79.35 [2019-03-28 12:46:30,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... 121.63/79.35 [2019-03-28 12:46:30,637 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 28 treesize of output 16 121.63/79.35 [2019-03-28 12:46:30,637 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.35 [2019-03-28 12:46:30,643 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.35 [2019-03-28 12:46:30,643 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.35 [2019-03-28 12:46:30,643 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 121.63/79.35 [2019-03-28 12:46:30,646 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 121.63/79.35 [2019-03-28 12:46:30,647 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 121.63/79.35 [2019-03-28 12:46:30,653 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 121.63/79.35 [2019-03-28 12:46:30,653 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 121.63/79.35 [2019-03-28 12:46:30,654 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 121.63/79.35 [2019-03-28 12:46:30,655 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization 121.63/79.35 [2019-03-28 12:46:30,655 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 7 loop predicates 121.63/79.35 [2019-03-28 12:46:30,655 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 109 states and 128 transitions. cyclomatic complexity: 22 Second operand 8 states. 121.63/79.35 [2019-03-28 12:46:31,378 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 109 states and 128 transitions. cyclomatic complexity: 22. Second operand 8 states. Result 3112 states and 3483 transitions. Complement of second has 681 states. 121.63/79.35 [2019-03-28 12:46:31,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 3 stem states 18 non-accepting loop states 2 accepting loop states 121.63/79.35 [2019-03-28 12:46:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 121.63/79.35 [2019-03-28 12:46:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 126 transitions. 121.63/79.35 [2019-03-28 12:46:31,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 126 transitions. Stem has 24 letters. Loop has 14 letters. 121.63/79.35 [2019-03-28 12:46:31,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.35 [2019-03-28 12:46:31,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 126 transitions. Stem has 38 letters. Loop has 14 letters. 121.63/79.35 [2019-03-28 12:46:31,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.35 [2019-03-28 12:46:31,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 126 transitions. Stem has 24 letters. Loop has 28 letters. 121.63/79.35 [2019-03-28 12:46:31,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. 121.63/79.35 [2019-03-28 12:46:31,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3112 states and 3483 transitions. 121.63/79.35 [2019-03-28 12:46:31,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 121.63/79.35 [2019-03-28 12:46:31,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3112 states to 0 states and 0 transitions. 121.63/79.35 [2019-03-28 12:46:31,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 121.63/79.35 [2019-03-28 12:46:31,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 121.63/79.35 [2019-03-28 12:46:31,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 121.63/79.35 [2019-03-28 12:46:31,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 121.63/79.35 [2019-03-28 12:46:31,409 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 121.63/79.35 [2019-03-28 12:46:31,409 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 121.63/79.35 [2019-03-28 12:46:31,410 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 121.63/79.35 [2019-03-28 12:46:31,410 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 121.63/79.35 [2019-03-28 12:46:31,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 121.63/79.35 [2019-03-28 12:46:31,410 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 121.63/79.35 [2019-03-28 12:46:31,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 121.63/79.35 [2019-03-28 12:46:31,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:31 BasicIcfg 121.63/79.35 [2019-03-28 12:46:31,417 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 121.63/79.35 [2019-03-28 12:46:31,418 INFO L168 Benchmark]: Toolchain (without parser) took 74856.53 ms. Allocated memory was 649.6 MB in the beginning and 1.2 GB in the end (delta: 579.3 MB). Free memory was 558.5 MB in the beginning and 984.1 MB in the end (delta: -425.6 MB). Peak memory consumption was 153.8 MB. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,419 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.56 ms. Allocated memory was 649.6 MB in the beginning and 663.2 MB in the end (delta: 13.6 MB). Free memory was 558.5 MB in the beginning and 630.6 MB in the end (delta: -72.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.72 ms. Allocated memory is still 663.2 MB. Free memory was 630.6 MB in the beginning and 627.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,420 INFO L168 Benchmark]: Boogie Preprocessor took 25.59 ms. Allocated memory is still 663.2 MB. Free memory was 627.5 MB in the beginning and 626.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,420 INFO L168 Benchmark]: RCFGBuilder took 371.75 ms. Allocated memory is still 663.2 MB. Free memory was 624.8 MB in the beginning and 599.8 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,420 INFO L168 Benchmark]: BlockEncodingV2 took 159.73 ms. Allocated memory is still 663.2 MB. Free memory was 599.8 MB in the beginning and 589.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,421 INFO L168 Benchmark]: TraceAbstraction took 1699.90 ms. Allocated memory is still 663.2 MB. Free memory was 589.0 MB in the beginning and 395.6 MB in the end (delta: 193.4 MB). Peak memory consumption was 193.4 MB. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,421 INFO L168 Benchmark]: BuchiAutomizer took 72237.56 ms. Allocated memory was 663.2 MB in the beginning and 1.2 GB in the end (delta: 565.7 MB). Free memory was 395.6 MB in the beginning and 984.1 MB in the end (delta: -588.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 121.63/79.35 [2019-03-28 12:46:31,423 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 121.63/79.35 --- Results --- 121.63/79.35 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 121.63/79.35 - StatisticsResult: Initial Icfg 121.63/79.35 52 locations, 56 edges 121.63/79.35 - StatisticsResult: Encoded RCFG 121.63/79.35 43 locations, 80 edges 121.63/79.35 * Results from de.uni_freiburg.informatik.ultimate.core: 121.63/79.35 - StatisticsResult: Toolchain Benchmarks 121.63/79.35 Benchmark results are: 121.63/79.35 * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 121.63/79.35 * CACSL2BoogieTranslator took 312.56 ms. Allocated memory was 649.6 MB in the beginning and 663.2 MB in the end (delta: 13.6 MB). Free memory was 558.5 MB in the beginning and 630.6 MB in the end (delta: -72.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 121.63/79.35 * Boogie Procedure Inliner took 43.72 ms. Allocated memory is still 663.2 MB. Free memory was 630.6 MB in the beginning and 627.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 121.63/79.35 * Boogie Preprocessor took 25.59 ms. Allocated memory is still 663.2 MB. Free memory was 627.5 MB in the beginning and 626.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 121.63/79.35 * RCFGBuilder took 371.75 ms. Allocated memory is still 663.2 MB. Free memory was 624.8 MB in the beginning and 599.8 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. 121.63/79.35 * BlockEncodingV2 took 159.73 ms. Allocated memory is still 663.2 MB. Free memory was 599.8 MB in the beginning and 589.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 121.63/79.35 * TraceAbstraction took 1699.90 ms. Allocated memory is still 663.2 MB. Free memory was 589.0 MB in the beginning and 395.6 MB in the end (delta: 193.4 MB). Peak memory consumption was 193.4 MB. Max. memory is 50.3 GB. 121.63/79.35 * BuchiAutomizer took 72237.56 ms. Allocated memory was 663.2 MB in the beginning and 1.2 GB in the end (delta: 565.7 MB). Free memory was 395.6 MB in the beginning and 984.1 MB in the end (delta: -588.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 121.63/79.35 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #length 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #length 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #length 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #length 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #length 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #length 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 - GenericResult: Unfinished Backtranslation 121.63/79.35 unknown boogie variable #memory_int 121.63/79.35 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 121.63/79.35 - PositiveResult [Line: 10]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 15]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 15]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 10]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 10]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 16]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 16]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 10]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 10]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 16]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 16]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 12]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 12]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 17]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 17]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 12]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 12]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 17]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 13]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 13]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 10]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - PositiveResult [Line: 17]: pointer dereference always succeeds 121.63/79.35 For all program executions holds that pointer dereference always succeeds at this location 121.63/79.35 - AllSpecificationsHoldResult: All specifications hold 121.63/79.35 22 specifications checked. All of them hold 121.63/79.35 - InvariantResult [Line: 10]: Loop Invariant 121.63/79.35 [2019-03-28 12:46:31,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.63/79.35 [2019-03-28 12:46:31,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.63/79.35 [2019-03-28 12:46:31,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.63/79.35 [2019-03-28 12:46:31,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.63/79.35 [2019-03-28 12:46:31,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.63/79.35 [2019-03-28 12:46:31,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 121.63/79.35 Derived loop invariant: (((((((d == 0 && \valid[y] == 1) && 1 == \valid[d]) && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[x]) && y == 0) && unknown-#length-unknown[d] == 4 121.63/79.35 - StatisticsResult: Ultimate Automizer benchmark data 121.63/79.35 CFG has 1 procedures, 43 locations, 22 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 84 SDtfs, 270 SDslu, 88 SDs, 0 SdLazy, 462 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 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, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 1659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 121.63/79.35 - StatisticsResult: Constructed decomposition of program 121.63/79.35 Your program was decomposed into 14 terminating modules (2 trivial, 0 deterministic, 12 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 22 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 34 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 23 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 121.63/79.35 - StatisticsResult: Timing statistics 121.63/79.35 BüchiAutomizer plugin needed 72.2s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 16.4s. Construction of modules took 1.9s. Büchi inclusion checks took 53.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1177 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 190 states and ocurred in iteration 12. Nontrivial modules had stage [12, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/22 HoareTripleCheckerStatistics: 301 SDtfs, 2153 SDslu, 935 SDs, 0 SdLazy, 2452 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso12 LassoPreprocessingBenchmarks: Lassos: inital392 mio100 ax100 hnf100 lsp96 ukn63 mio100 lsp40 div100 bol100 ite100 ukn100 eq192 hnf87 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 121.63/79.35 - TerminationAnalysisResult: Termination proven 121.63/79.35 Buchi Automizer proved that your program is terminating 121.63/79.35 RESULT: Ultimate proved your program to be correct! 121.63/79.35 !SESSION 2019-03-28 12:45:13.240 ----------------------------------------------- 121.63/79.35 eclipse.buildId=unknown 121.63/79.35 java.version=1.8.0_181 121.63/79.35 java.vendor=Oracle Corporation 121.63/79.35 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 121.63/79.35 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 121.63/79.35 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 121.63/79.35 121.63/79.35 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:31.663 121.63/79.35 !MESSAGE The workspace will exit with unsaved changes in this session. 121.63/79.35 Received shutdown request... 121.63/79.35 Ultimate: 121.63/79.35 GTK+ Version Check 121.63/79.35 EOF