./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13fe1afeee88065faace0f9ad16456f5e678cf43 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:54:06,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:54:06,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:54:06,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:54:06,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:54:06,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:54:06,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:54:06,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:54:06,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:54:06,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:54:06,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:54:06,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:54:06,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:54:06,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:54:06,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:54:06,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:54:06,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:54:06,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:54:06,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:54:06,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:54:06,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:54:06,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:54:06,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:54:06,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:54:06,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:54:06,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:54:06,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:54:06,346 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:54:06,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:54:06,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:54:06,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:54:06,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:54:06,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:54:06,348 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:54:06,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:54:06,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:54:06,349 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:54:06,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:54:06,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:54:06,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:54:06,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:54:06,358 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:54:06,358 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:54:06,358 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:54:06,358 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:54:06,359 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:54:06,359 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:54:06,359 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:54:06,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:54:06,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:54:06,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:54:06,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:54:06,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:54:06,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:54:06,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:54:06,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:54:06,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:54:06,360 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:54:06,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:54:06,360 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:54:06,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:54:06,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:54:06,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:54:06,361 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:54:06,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:54:06,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:54:06,361 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:54:06,362 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:54:06,362 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13fe1afeee88065faace0f9ad16456f5e678cf43 [2018-11-10 03:54:06,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:54:06,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:54:06,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:54:06,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:54:06,400 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:54:06,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:54:06,451 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/data/23bb9cab6/d23c97222992415899d2e35d1bce3c68/FLAG38f7cfa79 [2018-11-10 03:54:06,815 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:54:06,816 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:54:06,823 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/data/23bb9cab6/d23c97222992415899d2e35d1bce3c68/FLAG38f7cfa79 [2018-11-10 03:54:06,832 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/data/23bb9cab6/d23c97222992415899d2e35d1bce3c68 [2018-11-10 03:54:06,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:54:06,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:54:06,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:54:06,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:54:06,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:54:06,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:54:06" (1/1) ... [2018-11-10 03:54:06,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a507d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:06, skipping insertion in model container [2018-11-10 03:54:06,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:54:06" (1/1) ... [2018-11-10 03:54:06,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:54:06,879 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:54:07,064 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:54:07,072 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:54:07,103 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:54:07,134 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:54:07,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07 WrapperNode [2018-11-10 03:54:07,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:54:07,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:54:07,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:54:07,135 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:54:07,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:54:07,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:54:07,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:54:07,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:54:07,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... [2018-11-10 03:54:07,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:54:07,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:54:07,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:54:07,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:54:07,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:54:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:54:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:54:07,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:54:07,572 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:54:07,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:54:07 BoogieIcfgContainer [2018-11-10 03:54:07,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:54:07,573 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:54:07,573 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:54:07,576 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:54:07,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:54:07,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:54:06" (1/3) ... [2018-11-10 03:54:07,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a2522b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:54:07, skipping insertion in model container [2018-11-10 03:54:07,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:54:07,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:07" (2/3) ... [2018-11-10 03:54:07,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a2522b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:54:07, skipping insertion in model container [2018-11-10 03:54:07,579 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:54:07,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:54:07" (3/3) ... [2018-11-10 03:54:07,580 INFO L375 chiAutomizerObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:54:07,622 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:54:07,622 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:54:07,622 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:54:07,622 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:54:07,622 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:54:07,622 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:54:07,622 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:54:07,623 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:54:07,623 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:54:07,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2018-11-10 03:54:07,655 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 03:54:07,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:07,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:07,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 03:54:07,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:54:07,662 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:54:07,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2018-11-10 03:54:07,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 03:54:07,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:07,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:07,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 03:54:07,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:54:07,672 INFO L793 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 24#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 30#L558-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 12#L545-3true [2018-11-10 03:54:07,673 INFO L795 eck$LassoCheckResult]: Loop: 12#L545-3true assume true; 32#L545-1true assume !!(lis_~i~0 < lis_~N); 6#L546true SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 7#L546-1true SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 9#L546-2true lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 12#L545-3true [2018-11-10 03:54:07,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 03:54:07,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:07,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:07,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:07,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash 41190063, now seen corresponding path program 1 times [2018-11-10 03:54:07,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:07,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:07,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:07,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:07,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:07,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1181921611, now seen corresponding path program 1 times [2018-11-10 03:54:07,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:07,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:07,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:08,058 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-10 03:54:08,150 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:08,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:08,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:08,152 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:08,152 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:54:08,152 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:08,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:08,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:08,152 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 03:54:08,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:08,153 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:08,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,496 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2018-11-10 03:54:08,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:08,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:09,008 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:09,013 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:54:09,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:09,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:09,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:09,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:09,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,028 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:54:09,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,031 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:54:09,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:09,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:09,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:09,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,082 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:54:09,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,084 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:54:09,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:09,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:09,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:09,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:09,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:09,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:09,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:09,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:09,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:09,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:09,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:09,178 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:54:09,221 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 03:54:09,221 INFO L444 ModelExtractionUtils]: 46 out of 55 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 03:54:09,223 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:54:09,224 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:54:09,225 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:54:09,225 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2018-11-10 03:54:09,270 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 03:54:09,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:09,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:09,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:09,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:54:09,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states. Second operand 4 states. [2018-11-10 03:54:09,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states.. Second operand 4 states. Result 79 states and 100 transitions. Complement of second has 8 states. [2018-11-10 03:54:09,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:54:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-10 03:54:09,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-10 03:54:09,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:09,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-10 03:54:09,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:09,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-10 03:54:09,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:09,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2018-11-10 03:54:09,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 03:54:09,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 38 states and 48 transitions. [2018-11-10 03:54:09,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 03:54:09,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 03:54:09,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2018-11-10 03:54:09,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:09,428 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-10 03:54:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2018-11-10 03:54:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-10 03:54:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 03:54:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-10 03:54:09,456 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-10 03:54:09,456 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-10 03:54:09,456 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:54:09,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2018-11-10 03:54:09,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 03:54:09,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:09,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:09,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:09,457 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:54:09,458 INFO L793 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 251#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 268#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 252#L545-3 assume true; 254#L545-1 assume !(lis_~i~0 < lis_~N); 261#L545-4 lis_~i~0 := 1; 262#L547-4 [2018-11-10 03:54:09,458 INFO L795 eck$LassoCheckResult]: Loop: 262#L547-4 assume true; 272#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 247#L548-4 assume !true; 242#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 262#L547-4 [2018-11-10 03:54:09,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814418, now seen corresponding path program 1 times [2018-11-10 03:54:09,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:09,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:09,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:09,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:09,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:54:09,501 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:09,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1853096, now seen corresponding path program 1 times [2018-11-10 03:54:09,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:09,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:09,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:09,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:09,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:54:09,506 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:54:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:54:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:54:09,510 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 13 Second operand 2 states. [2018-11-10 03:54:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:09,514 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-10 03:54:09,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:54:09,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2018-11-10 03:54:09,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 03:54:09,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 46 transitions. [2018-11-10 03:54:09,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 03:54:09,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 03:54:09,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2018-11-10 03:54:09,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:09,517 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-10 03:54:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2018-11-10 03:54:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-10 03:54:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 03:54:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-10 03:54:09,519 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-10 03:54:09,519 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-10 03:54:09,519 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:54:09,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2018-11-10 03:54:09,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 03:54:09,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:09,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:09,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:09,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:54:09,520 INFO L793 eck$LassoCheckResult]: Stem: 359#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 334#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 351#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 335#L545-3 assume true; 337#L545-1 assume !(lis_~i~0 < lis_~N); 342#L545-4 lis_~i~0 := 1; 343#L547-4 [2018-11-10 03:54:09,520 INFO L795 eck$LassoCheckResult]: Loop: 343#L547-4 assume true; 354#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 331#L548-4 assume true; 325#L548-1 assume !(lis_~j~0 < lis_~i~0); 326#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 343#L547-4 [2018-11-10 03:54:09,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814418, now seen corresponding path program 2 times [2018-11-10 03:54:09,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:09,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:09,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:09,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:09,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:54:09,567 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:09,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash 57416318, now seen corresponding path program 1 times [2018-11-10 03:54:09,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:09,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:09,582 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:09,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:09,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:09,582 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:09,582 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:54:09,582 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:09,582 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:09,582 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:09,582 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration3_Loop [2018-11-10 03:54:09,582 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:09,582 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:09,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:09,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:09,606 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:09,606 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:09,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:54:09,611 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:09,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:54:09,655 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:54:09,778 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:54:09,780 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:09,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:09,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:09,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:09,780 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:54:09,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:09,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:09,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:09,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration3_Loop [2018-11-10 03:54:09,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:09,780 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:09,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:09,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:09,811 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:09,811 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:54:09,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:09,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:09,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:09,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:09,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:09,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:09,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:09,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:09,818 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:54:09,819 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:54:09,819 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 03:54:09,819 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:54:09,819 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:54:09,820 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:54:09,820 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2018-11-10 03:54:09,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:54:09,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:09,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:09,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:09,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:54:09,875 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 46 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-10 03:54:09,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 46 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 92 states and 111 transitions. Complement of second has 9 states. [2018-11-10 03:54:09,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:54:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-10 03:54:09,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 03:54:09,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:09,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 03:54:09,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:09,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-10 03:54:09,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:09,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 111 transitions. [2018-11-10 03:54:09,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-10 03:54:09,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 90 states and 109 transitions. [2018-11-10 03:54:09,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 03:54:09,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 03:54:09,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 109 transitions. [2018-11-10 03:54:09,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:09,952 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-11-10 03:54:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 109 transitions. [2018-11-10 03:54:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2018-11-10 03:54:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 03:54:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-11-10 03:54:09,955 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 77 transitions. [2018-11-10 03:54:09,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:54:09,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:54:09,957 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 4 states. [2018-11-10 03:54:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:10,002 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-11-10 03:54:10,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:54:10,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 81 transitions. [2018-11-10 03:54:10,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 03:54:10,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 67 states and 80 transitions. [2018-11-10 03:54:10,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 03:54:10,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 03:54:10,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2018-11-10 03:54:10,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:10,005 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-10 03:54:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2018-11-10 03:54:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-10 03:54:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 03:54:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2018-11-10 03:54:10,009 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-11-10 03:54:10,009 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-11-10 03:54:10,009 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:54:10,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 76 transitions. [2018-11-10 03:54:10,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 03:54:10,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:10,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:10,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:10,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:10,011 INFO L793 eck$LassoCheckResult]: Stem: 708#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 669#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 691#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 670#L545-3 assume true; 671#L545-1 assume !!(lis_~i~0 < lis_~N); 661#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 662#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 663#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 666#L545-3 assume true; 672#L545-1 assume !(lis_~i~0 < lis_~N); 677#L545-4 lis_~i~0 := 1; 678#L547-4 assume true; 695#L547-1 [2018-11-10 03:54:10,011 INFO L795 eck$LassoCheckResult]: Loop: 695#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 667#L548-4 assume true; 654#L548-1 assume !!(lis_~j~0 < lis_~i~0); 655#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 687#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 688#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 693#L549-3 assume !lis_#t~short11; 679#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 659#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 664#L548-4 assume true; 712#L548-1 assume !(lis_~j~0 < lis_~i~0); 702#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 703#L547-4 assume true; 695#L547-1 [2018-11-10 03:54:10,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2144943090, now seen corresponding path program 1 times [2018-11-10 03:54:10,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:10,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1193874324, now seen corresponding path program 1 times [2018-11-10 03:54:10,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:10,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:10,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:10,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:10,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1088446491, now seen corresponding path program 1 times [2018-11-10 03:54:10,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:10,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:10,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:10,118 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:10,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:10,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:54:10,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:10,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-10 03:54:10,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:54:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:54:10,292 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. cyclomatic complexity: 17 Second operand 11 states. [2018-11-10 03:54:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:10,414 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-11-10 03:54:10,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 03:54:10,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 175 transitions. [2018-11-10 03:54:10,415 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2018-11-10 03:54:10,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 135 states and 159 transitions. [2018-11-10 03:54:10,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-10 03:54:10,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-10 03:54:10,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 159 transitions. [2018-11-10 03:54:10,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:10,417 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 159 transitions. [2018-11-10 03:54:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 159 transitions. [2018-11-10 03:54:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 68. [2018-11-10 03:54:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 03:54:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-10 03:54:10,420 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-11-10 03:54:10,420 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-11-10 03:54:10,420 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:54:10,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 81 transitions. [2018-11-10 03:54:10,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 03:54:10,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:10,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:10,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:10,422 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:10,422 INFO L793 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 982#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 983#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1006#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 984#L545-3 assume true; 985#L545-1 assume !!(lis_~i~0 < lis_~N); 1027#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 1026#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 1025#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 986#L545-3 assume true; 987#L545-1 assume !!(lis_~i~0 < lis_~N); 975#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 976#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 977#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 980#L545-3 assume true; 1017#L545-1 assume !(lis_~i~0 < lis_~N); 992#L545-4 lis_~i~0 := 1; 993#L547-4 assume true; 1010#L547-1 [2018-11-10 03:54:10,422 INFO L795 eck$LassoCheckResult]: Loop: 1010#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 981#L548-4 assume true; 968#L548-1 assume !!(lis_~j~0 < lis_~i~0); 969#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 1002#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 1003#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1008#L549-3 assume !lis_#t~short11; 994#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 973#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 978#L548-4 assume true; 1028#L548-1 assume !(lis_~j~0 < lis_~i~0); 1018#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 1019#L547-4 assume true; 1010#L547-1 [2018-11-10 03:54:10,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:10,422 INFO L82 PathProgramCache]: Analyzing trace with hash 407559500, now seen corresponding path program 2 times [2018-11-10 03:54:10,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:10,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:10,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:10,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1193874324, now seen corresponding path program 2 times [2018-11-10 03:54:10,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:10,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1948958463, now seen corresponding path program 2 times [2018-11-10 03:54:10,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:10,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:10,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:10,980 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 128 [2018-11-10 03:54:11,116 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-10 03:54:11,118 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:11,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:11,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:11,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:11,118 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:54:11,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:11,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:11,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:11,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 03:54:11,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:11,119 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:11,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,480 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-11-10 03:54:11,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:11,784 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-11-10 03:54:12,068 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:12,069 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:54:12,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:12,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:12,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:12,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:12,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,090 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:54:12,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:54:12,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:12,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:12,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:12,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:12,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:12,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:12,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:12,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:12,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:12,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:12,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:12,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:12,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:12,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:12,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:12,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:12,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:54:12,160 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 03:54:12,160 INFO L444 ModelExtractionUtils]: 60 out of 70 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-10 03:54:12,161 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:54:12,161 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:54:12,162 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:54:12,162 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 3 Supporting invariants [] [2018-11-10 03:54:12,250 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2018-11-10 03:54:12,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:12,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:12,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:12,318 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 03:54:12,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 81 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-11-10 03:54:12,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 81 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 234 states and 281 transitions. Complement of second has 13 states. [2018-11-10 03:54:12,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:54:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2018-11-10 03:54:12,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 18 letters. Loop has 13 letters. [2018-11-10 03:54:12,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:12,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 31 letters. Loop has 13 letters. [2018-11-10 03:54:12,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:12,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 18 letters. Loop has 26 letters. [2018-11-10 03:54:12,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:12,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 281 transitions. [2018-11-10 03:54:12,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2018-11-10 03:54:12,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 182 states and 217 transitions. [2018-11-10 03:54:12,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-10 03:54:12,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 03:54:12,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 217 transitions. [2018-11-10 03:54:12,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:12,434 INFO L705 BuchiCegarLoop]: Abstraction has 182 states and 217 transitions. [2018-11-10 03:54:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 217 transitions. [2018-11-10 03:54:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 122. [2018-11-10 03:54:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-10 03:54:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2018-11-10 03:54:12,443 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 147 transitions. [2018-11-10 03:54:12,443 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 147 transitions. [2018-11-10 03:54:12,443 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:54:12,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 147 transitions. [2018-11-10 03:54:12,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:54:12,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:12,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:12,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:12,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 03:54:12,445 INFO L793 eck$LassoCheckResult]: Stem: 1587#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1538#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1539#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1563#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1542#L545-3 assume true; 1543#L545-1 assume !!(lis_~i~0 < lis_~N); 1528#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 1529#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 1590#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 1544#L545-3 assume true; 1545#L545-1 assume !!(lis_~i~0 < lis_~N); 1592#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 1532#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 1533#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 1537#L545-3 assume true; 1583#L545-1 assume !(lis_~i~0 < lis_~N); 1552#L545-4 lis_~i~0 := 1; 1553#L547-4 assume true; 1601#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1534#L548-4 [2018-11-10 03:54:12,445 INFO L795 eck$LassoCheckResult]: Loop: 1534#L548-4 assume true; 1535#L548-1 assume !!(lis_~j~0 < lis_~i~0); 1600#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 1599#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 1597#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1570#L549-3 assume !lis_#t~short11; 1548#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 1526#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 1530#L548-4 assume true; 1521#L548-1 assume !!(lis_~j~0 < lis_~i~0); 1522#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 1559#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 1560#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1565#L549-3 assume !lis_#t~short11; 1594#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 1593#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 1591#L548-4 assume true; 1589#L548-1 assume !(lis_~j~0 < lis_~i~0); 1576#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 1577#L547-4 assume true; 1584#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1534#L548-4 [2018-11-10 03:54:12,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:12,445 INFO L82 PathProgramCache]: Analyzing trace with hash -250557353, now seen corresponding path program 1 times [2018-11-10 03:54:12,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:12,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:12,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:12,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 351181960, now seen corresponding path program 3 times [2018-11-10 03:54:12,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:12,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:12,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:12,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash 797049330, now seen corresponding path program 3 times [2018-11-10 03:54:12,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:12,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:54:12,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:12,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:54:12,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:54:12,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:54:12,661 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. cyclomatic complexity: 30 Second operand 6 states. [2018-11-10 03:54:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:12,742 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2018-11-10 03:54:12,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:54:12,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 209 transitions. [2018-11-10 03:54:12,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:54:12,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 161 states and 190 transitions. [2018-11-10 03:54:12,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-10 03:54:12,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 03:54:12,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 190 transitions. [2018-11-10 03:54:12,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:12,745 INFO L705 BuchiCegarLoop]: Abstraction has 161 states and 190 transitions. [2018-11-10 03:54:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 190 transitions. [2018-11-10 03:54:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-11-10 03:54:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 03:54:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2018-11-10 03:54:12,750 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 186 transitions. [2018-11-10 03:54:12,750 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 186 transitions. [2018-11-10 03:54:12,751 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:54:12,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 186 transitions. [2018-11-10 03:54:12,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:54:12,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:12,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:12,752 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:12,752 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:54:12,752 INFO L793 eck$LassoCheckResult]: Stem: 1901#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1851#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1873#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1852#L545-3 assume true; 1853#L545-1 assume !!(lis_~i~0 < lis_~N); 1838#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 1839#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 1848#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 1849#L545-3 assume true; 1854#L545-1 assume !!(lis_~i~0 < lis_~N); 1919#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 1843#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 1844#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 1904#L545-3 assume true; 1894#L545-1 assume !(lis_~i~0 < lis_~N); 1863#L545-4 lis_~i~0 := 1; 1864#L547-4 assume true; 1896#L547-1 assume !(lis_~i~0 < lis_~N); 1855#L547-5 lis_~i~0 := 0; 1856#L551-4 [2018-11-10 03:54:12,753 INFO L795 eck$LassoCheckResult]: Loop: 1856#L551-4 assume true; 1877#L551-1 assume !!(lis_~i~0 < lis_~N); 1857#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 1858#L552-1 assume !(lis_~max~0 < lis_#t~mem14);havoc lis_#t~mem14; 1866#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := lis_#t~post13 + 1;havoc lis_#t~post13; 1856#L551-4 [2018-11-10 03:54:12,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash 822656662, now seen corresponding path program 1 times [2018-11-10 03:54:12,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:12,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:12,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:12,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:12,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:12,794 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:12,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:12,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:12,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:12,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-11-10 03:54:12,866 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:12,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash 104174385, now seen corresponding path program 1 times [2018-11-10 03:54:12,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:12,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:12,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:12,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:54:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:54:12,899 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. cyclomatic complexity: 34 Second operand 11 states. [2018-11-10 03:54:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:13,011 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2018-11-10 03:54:13,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:54:13,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 197 transitions. [2018-11-10 03:54:13,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:54:13,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 197 transitions. [2018-11-10 03:54:13,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 03:54:13,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-10 03:54:13,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 197 transitions. [2018-11-10 03:54:13,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:13,014 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 197 transitions. [2018-11-10 03:54:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 197 transitions. [2018-11-10 03:54:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2018-11-10 03:54:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 03:54:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2018-11-10 03:54:13,021 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 185 transitions. [2018-11-10 03:54:13,021 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 185 transitions. [2018-11-10 03:54:13,021 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:54:13,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 185 transitions. [2018-11-10 03:54:13,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:54:13,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:13,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:13,023 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:13,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 03:54:13,023 INFO L793 eck$LassoCheckResult]: Stem: 2295#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2249#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2250#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2273#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2251#L545-3 assume true; 2252#L545-1 assume !!(lis_~i~0 < lis_~N); 2241#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 2242#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 2243#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 2246#L545-3 assume true; 2253#L545-1 assume !!(lis_~i~0 < lis_~N); 2305#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 2303#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 2301#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 2298#L545-3 assume true; 2285#L545-1 assume !(lis_~i~0 < lis_~N); 2258#L545-4 lis_~i~0 := 1; 2259#L547-4 assume true; 2292#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2385#L548-4 assume true; 2384#L548-1 assume !(lis_~j~0 < lis_~i~0); 2322#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 2319#L547-4 assume true; 2297#L547-1 [2018-11-10 03:54:13,023 INFO L795 eck$LassoCheckResult]: Loop: 2297#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2247#L548-4 assume true; 2234#L548-1 assume !!(lis_~j~0 < lis_~i~0); 2235#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 2269#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 2270#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2274#L549-3 assume !lis_#t~short11; 2260#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 2238#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 2244#L548-4 assume true; 2316#L548-1 assume !!(lis_~j~0 < lis_~i~0); 2300#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 2315#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 2313#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2310#L549-3 assume !lis_#t~short11; 2306#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 2304#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 2302#L548-4 assume true; 2299#L548-1 assume !(lis_~j~0 < lis_~i~0); 2286#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 2287#L547-4 assume true; 2297#L547-1 [2018-11-10 03:54:13,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:13,024 INFO L82 PathProgramCache]: Analyzing trace with hash 682043825, now seen corresponding path program 1 times [2018-11-10 03:54:13,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:13,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:13,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:13,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:54:13,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:13,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:54:13,063 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:13,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1491068740, now seen corresponding path program 4 times [2018-11-10 03:54:13,063 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:13,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:13,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:13,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,201 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-11-10 03:54:13,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:54:13,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:54:13,218 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. cyclomatic complexity: 33 Second operand 4 states. [2018-11-10 03:54:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:13,245 INFO L93 Difference]: Finished difference Result 159 states and 186 transitions. [2018-11-10 03:54:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:54:13,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 186 transitions. [2018-11-10 03:54:13,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:54:13,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 186 transitions. [2018-11-10 03:54:13,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-10 03:54:13,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-10 03:54:13,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 186 transitions. [2018-11-10 03:54:13,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:13,248 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 186 transitions. [2018-11-10 03:54:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 186 transitions. [2018-11-10 03:54:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-11-10 03:54:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 03:54:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2018-11-10 03:54:13,255 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 184 transitions. [2018-11-10 03:54:13,255 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 184 transitions. [2018-11-10 03:54:13,255 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:54:13,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 184 transitions. [2018-11-10 03:54:13,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:54:13,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:13,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:13,257 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:13,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 03:54:13,257 INFO L793 eck$LassoCheckResult]: Stem: 2618#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2573#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2595#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2574#L545-3 assume true; 2575#L545-1 assume !!(lis_~i~0 < lis_~N); 2642#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 2565#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 2566#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 2569#L545-3 assume true; 2576#L545-1 assume !!(lis_~i~0 < lis_~N); 2563#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 2564#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 2625#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 2622#L545-3 assume true; 2607#L545-1 assume !(lis_~i~0 < lis_~N); 2581#L545-4 lis_~i~0 := 1; 2582#L547-4 assume true; 2599#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2600#L548-4 assume true; 2698#L548-1 assume !!(lis_~j~0 < lis_~i~0); 2697#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 2696#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 2695#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2679#L549-3 assume !lis_#t~short11; 2672#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 2670#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 2668#L548-4 assume true; 2646#L548-1 assume !(lis_~j~0 < lis_~i~0); 2645#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 2621#L547-4 assume true; 2620#L547-1 [2018-11-10 03:54:13,257 INFO L795 eck$LassoCheckResult]: Loop: 2620#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2570#L548-4 assume true; 2557#L548-1 assume !!(lis_~j~0 < lis_~i~0); 2558#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 2591#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 2592#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2596#L549-3 assume !lis_#t~short11; 2583#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 2561#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 2567#L548-4 assume true; 2639#L548-1 assume !!(lis_~j~0 < lis_~i~0); 2624#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 2637#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 2636#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2633#L549-3 assume !lis_#t~short11; 2628#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 2627#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 2626#L548-4 assume true; 2623#L548-1 assume !(lis_~j~0 < lis_~i~0); 2610#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 2611#L547-4 assume true; 2620#L547-1 [2018-11-10 03:54:13,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1948958463, now seen corresponding path program 4 times [2018-11-10 03:54:13,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:13,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1491068740, now seen corresponding path program 5 times [2018-11-10 03:54:13,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:13,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:13,282 INFO L82 PathProgramCache]: Analyzing trace with hash 919435196, now seen corresponding path program 5 times [2018-11-10 03:54:13,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:13,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:13,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:13,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:54:13,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:13,340 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:13,356 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 03:54:13,375 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-10 03:54:13,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:54:13,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:54:13,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:13,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-11-10 03:54:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:54:13,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:54:13,518 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. cyclomatic complexity: 32 Second operand 15 states. [2018-11-10 03:54:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:13,762 INFO L93 Difference]: Finished difference Result 360 states and 415 transitions. [2018-11-10 03:54:13,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 03:54:13,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 360 states and 415 transitions. [2018-11-10 03:54:13,765 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2018-11-10 03:54:13,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 360 states to 297 states and 346 transitions. [2018-11-10 03:54:13,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-11-10 03:54:13,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-11-10 03:54:13,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 346 transitions. [2018-11-10 03:54:13,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:13,767 INFO L705 BuchiCegarLoop]: Abstraction has 297 states and 346 transitions. [2018-11-10 03:54:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 346 transitions. [2018-11-10 03:54:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 162. [2018-11-10 03:54:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-10 03:54:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-11-10 03:54:13,775 INFO L728 BuchiCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-11-10 03:54:13,775 INFO L608 BuchiCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-11-10 03:54:13,775 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 03:54:13,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 189 transitions. [2018-11-10 03:54:13,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:54:13,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:13,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:13,777 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:13,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 03:54:13,777 INFO L793 eck$LassoCheckResult]: Stem: 3332#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3283#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3306#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3284#L545-3 assume true; 3285#L545-1 assume !!(lis_~i~0 < lis_~N); 3353#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 3338#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 3339#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 3286#L545-3 assume true; 3287#L545-1 assume !!(lis_~i~0 < lis_~N); 3342#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 3343#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 3280#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 3281#L545-3 assume true; 3327#L545-1 assume !!(lis_~i~0 < lis_~N); 3273#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 3274#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 3277#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 3334#L545-3 assume true; 3326#L545-1 assume !(lis_~i~0 < lis_~N); 3296#L545-4 lis_~i~0 := 1; 3297#L547-4 assume true; 3313#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3314#L548-4 assume true; 3411#L548-1 assume !!(lis_~j~0 < lis_~i~0); 3410#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 3409#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 3407#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3403#L549-3 assume !lis_#t~short11; 3399#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 3398#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 3397#L548-4 assume true; 3396#L548-1 assume !(lis_~j~0 < lis_~i~0); 3324#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 3325#L547-4 assume true; 3336#L547-1 [2018-11-10 03:54:13,777 INFO L795 eck$LassoCheckResult]: Loop: 3336#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3337#L548-4 assume true; 3360#L548-1 assume !!(lis_~j~0 < lis_~i~0); 3358#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 3357#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 3355#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3351#L549-3 assume !lis_#t~short11; 3292#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 3271#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 3275#L548-4 assume true; 3267#L548-1 assume !!(lis_~j~0 < lis_~i~0); 3268#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 3302#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 3303#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3308#L549-3 assume !lis_#t~short11; 3311#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 3341#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 3340#L548-4 assume true; 3335#L548-1 assume !(lis_~j~0 < lis_~i~0); 3322#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 3323#L547-4 assume true; 3336#L547-1 [2018-11-10 03:54:13,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1083768869, now seen corresponding path program 6 times [2018-11-10 03:54:13,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:13,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1491068740, now seen corresponding path program 6 times [2018-11-10 03:54:13,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:13,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:13,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:13,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1715430690, now seen corresponding path program 7 times [2018-11-10 03:54:13,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:13,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:13,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:13,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:14,794 WARN L179 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 164 [2018-11-10 03:54:15,021 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-10 03:54:15,022 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:15,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:15,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:15,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:15,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:54:15,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:15,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:15,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:15,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration10_Lasso [2018-11-10 03:54:15,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:15,023 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:15,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,499 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 116 [2018-11-10 03:54:15,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:15,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:16,003 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:16,003 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:54:16,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:16,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:16,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:16,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:16,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:16,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:16,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:16,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:16,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:16,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:16,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:16,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:16,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:16,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:16,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:16,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:16,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:16,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:16,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:16,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:16,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:16,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,039 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:54:16,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,040 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:54:16,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,068 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:16,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:16,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:16,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:16,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:16,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:16,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:16,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:16,105 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:54:16,159 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 03:54:16,159 INFO L444 ModelExtractionUtils]: 52 out of 61 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 03:54:16,160 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:54:16,160 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:54:16,163 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:54:16,163 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_lis_~a.base)_2) = -4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_~a.base)_2 Supporting invariants [] [2018-11-10 03:54:16,278 INFO L297 tatePredicateManager]: 46 out of 46 supporting invariants were superfluous and have been removed [2018-11-10 03:54:16,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:54:16,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:16,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:16,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 03:54:16,350 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 03:54:16,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 189 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-11-10 03:54:16,443 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 189 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 320 states and 376 transitions. Complement of second has 13 states. [2018-11-10 03:54:16,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:54:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-10 03:54:16,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 58 transitions. Stem has 36 letters. Loop has 21 letters. [2018-11-10 03:54:16,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:16,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 58 transitions. Stem has 57 letters. Loop has 21 letters. [2018-11-10 03:54:16,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:16,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 58 transitions. Stem has 36 letters. Loop has 42 letters. [2018-11-10 03:54:16,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:16,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 376 transitions. [2018-11-10 03:54:16,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:16,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 218 states and 256 transitions. [2018-11-10 03:54:16,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-10 03:54:16,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 03:54:16,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 218 states and 256 transitions. [2018-11-10 03:54:16,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:16,449 INFO L705 BuchiCegarLoop]: Abstraction has 218 states and 256 transitions. [2018-11-10 03:54:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states and 256 transitions. [2018-11-10 03:54:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 184. [2018-11-10 03:54:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-10 03:54:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 217 transitions. [2018-11-10 03:54:16,452 INFO L728 BuchiCegarLoop]: Abstraction has 184 states and 217 transitions. [2018-11-10 03:54:16,452 INFO L608 BuchiCegarLoop]: Abstraction has 184 states and 217 transitions. [2018-11-10 03:54:16,452 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 03:54:16,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 217 transitions. [2018-11-10 03:54:16,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:16,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:16,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:16,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:16,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:16,454 INFO L793 eck$LassoCheckResult]: Stem: 4206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4157#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4182#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4158#L545-3 assume true; 4159#L545-1 assume !!(lis_~i~0 < lis_~N); 4147#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 4148#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 4213#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 4160#L545-3 assume true; 4161#L545-1 assume !!(lis_~i~0 < lis_~N); 4214#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 4149#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 4150#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 4155#L545-3 assume true; 4209#L545-1 assume !!(lis_~i~0 < lis_~N); 4212#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 4211#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 4210#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 4208#L545-3 assume true; 4198#L545-1 assume !(lis_~i~0 < lis_~N); 4166#L545-4 lis_~i~0 := 1; 4167#L547-4 assume true; 4202#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4278#L548-4 assume true; 4277#L548-1 assume !!(lis_~j~0 < lis_~i~0); 4276#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 4275#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 4273#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4269#L549-3 assume !lis_#t~short11; 4265#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 4264#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 4263#L548-4 assume true; 4262#L548-1 assume !(lis_~j~0 < lis_~i~0); 4243#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 4260#L547-4 assume true; 4215#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4151#L548-4 [2018-11-10 03:54:16,454 INFO L795 eck$LassoCheckResult]: Loop: 4151#L548-4 assume true; 4141#L548-1 assume !!(lis_~j~0 < lis_~i~0); 4142#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 4178#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 4179#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4183#L549-3 assume !lis_#t~short11; 4168#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 4145#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 4151#L548-4 [2018-11-10 03:54:16,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash 762903464, now seen corresponding path program 8 times [2018-11-10 03:54:16,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:16,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:16,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:16,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:16,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:16,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:16,475 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 1 times [2018-11-10 03:54:16,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:16,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:16,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:16,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:16,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:16,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash -713074184, now seen corresponding path program 9 times [2018-11-10 03:54:16,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:16,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:16,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:16,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:17,665 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 212 DAG size of output: 170 [2018-11-10 03:54:17,931 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-10 03:54:17,933 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:17,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:17,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:17,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:17,933 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:54:17,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:17,934 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:17,934 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:17,934 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration11_Lasso [2018-11-10 03:54:17,934 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:17,934 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:17,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:17,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,521 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2018-11-10 03:54:18,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:18,767 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-10 03:54:19,031 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:19,031 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:54:19,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:19,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:19,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:19,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:19,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:19,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:19,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:19,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:19,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:19,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:19,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:19,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:19,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:19,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:19,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:19,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:19,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:19,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:19,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:19,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:19,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:19,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:19,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:19,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:19,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:19,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:54:19,102 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:54:19,103 INFO L444 ModelExtractionUtils]: 58 out of 67 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 03:54:19,103 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:54:19,103 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:54:19,104 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:54:19,104 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -4*ULTIMATE.start_lis_~j~0 + 3*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-10 03:54:19,270 INFO L297 tatePredicateManager]: 53 out of 55 supporting invariants were superfluous and have been removed [2018-11-10 03:54:19,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:19,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:19,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:19,337 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:54:19,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 184 states and 217 transitions. cyclomatic complexity: 40 Second operand 7 states. [2018-11-10 03:54:19,366 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 184 states and 217 transitions. cyclomatic complexity: 40. Second operand 7 states. Result 184 states and 217 transitions. Complement of second has 5 states. [2018-11-10 03:54:19,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:54:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 03:54:19,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 37 letters. Loop has 8 letters. [2018-11-10 03:54:19,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:19,367 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:54:19,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:19,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:19,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:19,439 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:54:19,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 184 states and 217 transitions. cyclomatic complexity: 40 Second operand 7 states. [2018-11-10 03:54:19,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 184 states and 217 transitions. cyclomatic complexity: 40. Second operand 7 states. Result 184 states and 217 transitions. Complement of second has 5 states. [2018-11-10 03:54:19,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:54:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 03:54:19,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 37 letters. Loop has 8 letters. [2018-11-10 03:54:19,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:19,458 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:54:19,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:19,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:19,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:19,529 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 2 loop predicates [2018-11-10 03:54:19,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 184 states and 217 transitions. cyclomatic complexity: 40 Second operand 7 states. [2018-11-10 03:54:19,610 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 184 states and 217 transitions. cyclomatic complexity: 40. Second operand 7 states. Result 395 states and 465 transitions. Complement of second has 11 states. [2018-11-10 03:54:19,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 03:54:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:54:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2018-11-10 03:54:19,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 108 transitions. Stem has 37 letters. Loop has 8 letters. [2018-11-10 03:54:19,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:19,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 108 transitions. Stem has 45 letters. Loop has 8 letters. [2018-11-10 03:54:19,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:19,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 108 transitions. Stem has 37 letters. Loop has 16 letters. [2018-11-10 03:54:19,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:19,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 465 transitions. [2018-11-10 03:54:19,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:19,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 290 states and 341 transitions. [2018-11-10 03:54:19,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-10 03:54:19,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-10 03:54:19,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 341 transitions. [2018-11-10 03:54:19,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:19,614 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 341 transitions. [2018-11-10 03:54:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 341 transitions. [2018-11-10 03:54:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 275. [2018-11-10 03:54:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-10 03:54:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 326 transitions. [2018-11-10 03:54:19,618 INFO L728 BuchiCegarLoop]: Abstraction has 275 states and 326 transitions. [2018-11-10 03:54:19,619 INFO L608 BuchiCegarLoop]: Abstraction has 275 states and 326 transitions. [2018-11-10 03:54:19,619 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 03:54:19,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 275 states and 326 transitions. [2018-11-10 03:54:19,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:19,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:19,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:19,620 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:19,620 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:54:19,621 INFO L793 eck$LassoCheckResult]: Stem: 5843#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5795#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 5796#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5820#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 5797#L545-3 assume true; 5798#L545-1 assume !!(lis_~i~0 < lis_~N); 5852#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 5851#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 5850#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 5799#L545-3 assume true; 5800#L545-1 assume !!(lis_~i~0 < lis_~N); 5787#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 5788#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 5792#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 5794#L545-3 assume true; 5846#L545-1 assume !!(lis_~i~0 < lis_~N); 5849#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 5848#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 5847#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 5845#L545-3 assume true; 5837#L545-1 assume !(lis_~i~0 < lis_~N); 5809#L545-4 lis_~i~0 := 1; 5810#L547-4 assume true; 5838#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5876#L548-4 assume true; 5875#L548-1 assume !!(lis_~j~0 < lis_~i~0); 5874#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 5873#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 5871#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5867#L549-3 assume !lis_#t~short11; 5863#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 5862#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 5861#L548-4 assume true; 5860#L548-1 assume !(lis_~j~0 < lis_~i~0); 5859#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 5855#L547-4 assume true; 5853#L547-1 assume !(lis_~i~0 < lis_~N); 5801#L547-5 lis_~i~0 := 0; 5802#L551-4 [2018-11-10 03:54:19,621 INFO L795 eck$LassoCheckResult]: Loop: 5802#L551-4 assume true; 5823#L551-1 assume !!(lis_~i~0 < lis_~N); 5803#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 5804#L552-1 assume !(lis_~max~0 < lis_#t~mem14);havoc lis_#t~mem14; 5812#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := lis_#t~post13 + 1;havoc lis_#t~post13; 5802#L551-4 [2018-11-10 03:54:19,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2119796379, now seen corresponding path program 1 times [2018-11-10 03:54:19,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:19,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:19,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:54:19,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:19,682 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:19,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:19,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:54:19,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:19,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-11-10 03:54:19,753 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:19,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:19,753 INFO L82 PathProgramCache]: Analyzing trace with hash 104174385, now seen corresponding path program 2 times [2018-11-10 03:54:19,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:19,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:19,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:54:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:54:19,784 INFO L87 Difference]: Start difference. First operand 275 states and 326 transitions. cyclomatic complexity: 61 Second operand 15 states. [2018-11-10 03:54:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:19,963 INFO L93 Difference]: Finished difference Result 299 states and 351 transitions. [2018-11-10 03:54:19,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:54:19,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 299 states and 351 transitions. [2018-11-10 03:54:19,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:19,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 299 states to 298 states and 350 transitions. [2018-11-10 03:54:19,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 03:54:19,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 03:54:19,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 350 transitions. [2018-11-10 03:54:19,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:19,966 INFO L705 BuchiCegarLoop]: Abstraction has 298 states and 350 transitions. [2018-11-10 03:54:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 350 transitions. [2018-11-10 03:54:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 274. [2018-11-10 03:54:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 03:54:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 324 transitions. [2018-11-10 03:54:19,971 INFO L728 BuchiCegarLoop]: Abstraction has 274 states and 324 transitions. [2018-11-10 03:54:19,971 INFO L608 BuchiCegarLoop]: Abstraction has 274 states and 324 transitions. [2018-11-10 03:54:19,971 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 03:54:19,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 274 states and 324 transitions. [2018-11-10 03:54:19,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:19,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:19,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:19,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:19,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:19,973 INFO L793 eck$LassoCheckResult]: Stem: 6566#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6514#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 6515#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6540#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 6516#L545-3 assume true; 6517#L545-1 assume !!(lis_~i~0 < lis_~N); 6555#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 6507#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 6508#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 6518#L545-3 assume true; 6519#L545-1 assume !!(lis_~i~0 < lis_~N); 6505#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 6506#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 6511#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 6512#L545-3 assume true; 6570#L545-1 assume !!(lis_~i~0 < lis_~N); 6573#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 6572#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 6571#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 6569#L545-3 assume true; 6554#L545-1 assume !(lis_~i~0 < lis_~N); 6524#L545-4 lis_~i~0 := 1; 6525#L547-4 assume true; 6560#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6724#L548-4 assume true; 6696#L548-1 assume !!(lis_~j~0 < lis_~i~0); 6693#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 6692#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 6689#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6690#L549-3 assume !lis_#t~short11; 6713#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 6712#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 6711#L548-4 assume true; 6709#L548-1 assume !(lis_~j~0 < lis_~i~0); 6586#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 6587#L547-4 assume true; 6575#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6726#L548-4 assume true; 6727#L548-1 assume !(lis_~j~0 < lis_~i~0); 6759#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 6574#L547-4 assume true; 6568#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6509#L548-4 [2018-11-10 03:54:19,973 INFO L795 eck$LassoCheckResult]: Loop: 6509#L548-4 assume true; 6499#L548-1 assume !!(lis_~j~0 < lis_~i~0); 6500#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 6536#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 6537#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6541#L549-3 assume !lis_#t~short11; 6526#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 6503#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 6509#L548-4 [2018-11-10 03:54:19,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash -288110623, now seen corresponding path program 10 times [2018-11-10 03:54:19,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:19,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:19,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 03:54:20,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:20,045 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:54:20,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:54:20,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:54:20,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:54:20,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:54:20,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2018-11-10 03:54:20,104 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:20,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 2 times [2018-11-10 03:54:20,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:20,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:54:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:54:20,149 INFO L87 Difference]: Start difference. First operand 274 states and 324 transitions. cyclomatic complexity: 60 Second operand 8 states. [2018-11-10 03:54:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:20,227 INFO L93 Difference]: Finished difference Result 317 states and 363 transitions. [2018-11-10 03:54:20,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:54:20,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 363 transitions. [2018-11-10 03:54:20,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:20,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 153 states and 174 transitions. [2018-11-10 03:54:20,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 03:54:20,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 03:54:20,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 174 transitions. [2018-11-10 03:54:20,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:20,231 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 174 transitions. [2018-11-10 03:54:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 174 transitions. [2018-11-10 03:54:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2018-11-10 03:54:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 03:54:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2018-11-10 03:54:20,233 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 154 transitions. [2018-11-10 03:54:20,233 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 154 transitions. [2018-11-10 03:54:20,233 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 03:54:20,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 154 transitions. [2018-11-10 03:54:20,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:20,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:20,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:20,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:20,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:20,235 INFO L793 eck$LassoCheckResult]: Stem: 7295#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7248#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7249#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7272#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7250#L545-3 assume true; 7251#L545-1 assume !!(lis_~i~0 < lis_~N); 7241#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 7242#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 7243#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 7246#L545-3 assume true; 7252#L545-1 assume !!(lis_~i~0 < lis_~N); 7310#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 7309#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 7308#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 7306#L545-3 assume true; 7300#L545-1 assume !!(lis_~i~0 < lis_~N); 7303#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 7302#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 7301#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 7299#L545-3 assume true; 7286#L545-1 assume !(lis_~i~0 < lis_~N); 7257#L545-4 lis_~i~0 := 1; 7258#L547-4 assume true; 7280#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7281#L548-4 assume true; 7325#L548-1 assume !!(lis_~j~0 < lis_~i~0); 7324#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 7323#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 7321#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7318#L549-3 assume !lis_#t~short11; 7314#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 7313#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 7312#L548-4 assume true; 7311#L548-1 assume !(lis_~j~0 < lis_~i~0); 7290#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 7291#L547-4 assume true; 7292#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7364#L548-4 assume true; 7363#L548-1 assume !!(lis_~j~0 < lis_~i~0); 7362#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 7270#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 7271#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7274#L549-3 assume !lis_#t~short11; 7261#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 7236#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 7245#L548-4 assume true; 7247#L548-1 assume !!(lis_~j~0 < lis_~i~0); 7355#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 7354#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 7353#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7335#L549-3 assume !lis_#t~short11; 7334#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 7329#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 7330#L548-4 assume true; 7307#L548-1 assume !(lis_~j~0 < lis_~i~0); 7305#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 7304#L547-4 assume true; 7298#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7244#L548-4 [2018-11-10 03:54:20,235 INFO L795 eck$LassoCheckResult]: Loop: 7244#L548-4 assume true; 7237#L548-1 assume !!(lis_~j~0 < lis_~i~0); 7238#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 7268#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 7269#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7273#L549-3 assume !lis_#t~short11; 7259#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 7234#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 7244#L548-4 [2018-11-10 03:54:20,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:20,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1638743873, now seen corresponding path program 11 times [2018-11-10 03:54:20,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:20,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 03:54:20,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:20,328 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 03:54:20,390 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-10 03:54:20,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:54:20,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 31 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 03:54:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-11-10 03:54:20,482 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:20,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 3 times [2018-11-10 03:54:20,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:20,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 03:54:20,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:54:20,527 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. cyclomatic complexity: 24 Second operand 20 states. [2018-11-10 03:54:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:20,920 INFO L93 Difference]: Finished difference Result 332 states and 377 transitions. [2018-11-10 03:54:20,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 03:54:20,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 377 transitions. [2018-11-10 03:54:20,922 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2018-11-10 03:54:20,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 248 states and 283 transitions. [2018-11-10 03:54:20,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-11-10 03:54:20,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-11-10 03:54:20,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 283 transitions. [2018-11-10 03:54:20,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:20,923 INFO L705 BuchiCegarLoop]: Abstraction has 248 states and 283 transitions. [2018-11-10 03:54:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 283 transitions. [2018-11-10 03:54:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 140. [2018-11-10 03:54:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 03:54:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2018-11-10 03:54:20,926 INFO L728 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-11-10 03:54:20,926 INFO L608 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-11-10 03:54:20,926 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 03:54:20,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 159 transitions. [2018-11-10 03:54:20,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:20,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:20,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:20,927 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:20,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:20,928 INFO L793 eck$LassoCheckResult]: Stem: 7980#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7935#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7936#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7960#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7939#L545-3 assume true; 7940#L545-1 assume !!(lis_~i~0 < lis_~N); 7928#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 7929#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 8000#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 7941#L545-3 assume true; 7942#L545-1 assume !!(lis_~i~0 < lis_~N); 8008#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 7932#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 7933#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 7934#L545-3 assume true; 7995#L545-1 assume !!(lis_~i~0 < lis_~N); 7993#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 7991#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 7990#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 7989#L545-3 assume true; 7982#L545-1 assume !!(lis_~i~0 < lis_~N); 7988#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 7987#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 7983#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 7981#L545-3 assume true; 7977#L545-1 assume !(lis_~i~0 < lis_~N); 7949#L545-4 lis_~i~0 := 1; 7950#L547-4 assume true; 7967#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7968#L548-4 assume true; 8011#L548-1 assume !!(lis_~j~0 < lis_~i~0); 8010#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 8009#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 8006#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8002#L549-3 assume !lis_#t~short11; 7997#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 7996#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 7994#L548-4 assume true; 7992#L548-1 assume !(lis_~j~0 < lis_~i~0); 7975#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 7976#L547-4 assume true; 7978#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8048#L548-4 assume true; 8047#L548-1 assume !!(lis_~j~0 < lis_~i~0); 8046#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 8045#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 8043#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8039#L549-3 assume !lis_#t~short11; 8035#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 8034#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 8033#L548-4 assume true; 8019#L548-1 assume !!(lis_~j~0 < lis_~i~0); 8032#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 8031#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 8029#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8025#L549-3 assume !lis_#t~short11; 8021#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 8020#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 8018#L548-4 assume true; 8012#L548-1 assume !(lis_~j~0 < lis_~i~0); 7986#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 7985#L547-4 assume true; 7984#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7930#L548-4 [2018-11-10 03:54:20,928 INFO L795 eck$LassoCheckResult]: Loop: 7930#L548-4 assume true; 7921#L548-1 assume !!(lis_~j~0 < lis_~i~0); 7922#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 7956#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 7957#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7961#L549-3 assume !lis_#t~short11; 7945#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 7925#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 7930#L548-4 [2018-11-10 03:54:20,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1326118873, now seen corresponding path program 12 times [2018-11-10 03:54:20,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:20,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 4 times [2018-11-10 03:54:20,960 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:20,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:20,965 INFO L82 PathProgramCache]: Analyzing trace with hash -534612105, now seen corresponding path program 13 times [2018-11-10 03:54:20,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:20,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:23,610 WARN L179 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 291 DAG size of output: 215 [2018-11-10 03:54:23,950 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-11-10 03:54:23,952 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:23,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:23,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:23,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:23,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:54:23,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:23,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:23,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:23,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration15_Lasso [2018-11-10 03:54:23,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:23,952 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:23,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:23,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,851 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 131 [2018-11-10 03:54:24,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:24,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:25,172 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-10 03:54:25,390 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:25,390 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:54:25,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,410 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:54:25,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:54:25,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:25,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:25,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:25,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,433 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:54:25,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,434 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:54:25,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,437 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:54:25,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:54:25,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:25,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:25,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:25,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:25,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:25,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:25,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:25,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:25,513 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:54:25,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:54:25,525 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 03:54:25,526 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:54:25,527 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:54:25,527 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:54:25,527 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -6*ULTIMATE.start_lis_~j~0 + 5*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-10 03:54:25,884 INFO L297 tatePredicateManager]: 77 out of 79 supporting invariants were superfluous and have been removed [2018-11-10 03:54:25,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:25,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:26,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:26,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 03:54:26,078 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 159 transitions. cyclomatic complexity: 24 Second operand 8 states. [2018-11-10 03:54:26,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 159 transitions. cyclomatic complexity: 24. Second operand 8 states. Result 140 states and 159 transitions. Complement of second has 5 states. [2018-11-10 03:54:26,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 03:54:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 03:54:26,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 03:54:26,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:26,138 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:54:26,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:26,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:26,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:26,249 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 03:54:26,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 159 transitions. cyclomatic complexity: 24 Second operand 8 states. [2018-11-10 03:54:26,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 159 transitions. cyclomatic complexity: 24. Second operand 8 states. Result 140 states and 159 transitions. Complement of second has 5 states. [2018-11-10 03:54:26,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 03:54:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 03:54:26,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 03:54:26,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:26,284 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:54:26,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:26,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:26,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:26,414 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 03:54:26,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 159 transitions. cyclomatic complexity: 24 Second operand 8 states. [2018-11-10 03:54:26,531 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 159 transitions. cyclomatic complexity: 24. Second operand 8 states. Result 240 states and 276 transitions. Complement of second has 13 states. [2018-11-10 03:54:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 03:54:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 03:54:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2018-11-10 03:54:26,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 130 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 03:54:26,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:26,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 130 transitions. Stem has 71 letters. Loop has 8 letters. [2018-11-10 03:54:26,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:26,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 130 transitions. Stem has 63 letters. Loop has 16 letters. [2018-11-10 03:54:26,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:26,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 240 states and 276 transitions. [2018-11-10 03:54:26,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:26,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 240 states to 181 states and 206 transitions. [2018-11-10 03:54:26,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 03:54:26,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-10 03:54:26,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 206 transitions. [2018-11-10 03:54:26,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:26,546 INFO L705 BuchiCegarLoop]: Abstraction has 181 states and 206 transitions. [2018-11-10 03:54:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 206 transitions. [2018-11-10 03:54:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2018-11-10 03:54:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-10 03:54:26,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2018-11-10 03:54:26,549 INFO L728 BuchiCegarLoop]: Abstraction has 176 states and 201 transitions. [2018-11-10 03:54:26,549 INFO L608 BuchiCegarLoop]: Abstraction has 176 states and 201 transitions. [2018-11-10 03:54:26,549 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 03:54:26,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 201 transitions. [2018-11-10 03:54:26,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:26,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:26,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:26,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:26,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:54:26,551 INFO L793 eck$LassoCheckResult]: Stem: 9667#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 9625#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9648#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 9628#L545-3 assume true; 9629#L545-1 assume !!(lis_~i~0 < lis_~N); 9615#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 9616#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 9620#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 9630#L545-3 assume true; 9631#L545-1 assume !!(lis_~i~0 < lis_~N); 9664#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 9679#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 9622#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 9623#L545-3 assume true; 9678#L545-1 assume !!(lis_~i~0 < lis_~N); 9677#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 9676#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 9675#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 9674#L545-3 assume true; 9670#L545-1 assume !!(lis_~i~0 < lis_~N); 9673#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 9672#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 9671#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 9669#L545-3 assume true; 9663#L545-1 assume !(lis_~i~0 < lis_~N); 9638#L545-4 lis_~i~0 := 1; 9639#L547-4 assume true; 9654#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9655#L548-4 assume true; 9731#L548-1 assume !!(lis_~j~0 < lis_~i~0); 9727#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 9722#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 9717#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9702#L549-3 assume !lis_#t~short11; 9695#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 9693#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 9690#L548-4 assume true; 9688#L548-1 assume !(lis_~j~0 < lis_~i~0); 9661#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 9662#L547-4 assume true; 9665#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9735#L548-4 assume true; 9734#L548-1 assume !!(lis_~j~0 < lis_~i~0); 9733#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 9732#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 9729#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9724#L549-3 assume !lis_#t~short11; 9718#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 9714#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 9713#L548-4 assume true; 9692#L548-1 assume !!(lis_~j~0 < lis_~i~0); 9711#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 9710#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 9709#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9706#L549-3 assume !lis_#t~short11; 9698#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 9694#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 9691#L548-4 assume true; 9689#L548-1 assume !(lis_~j~0 < lis_~i~0); 9687#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 9686#L547-4 assume true; 9684#L547-1 assume !(lis_~i~0 < lis_~N); 9626#L547-5 lis_~i~0 := 0; 9627#L551-4 [2018-11-10 03:54:26,551 INFO L795 eck$LassoCheckResult]: Loop: 9627#L551-4 assume true; 9651#L551-1 assume !!(lis_~i~0 < lis_~N); 9632#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 9633#L552-1 assume !(lis_~max~0 < lis_#t~mem14);havoc lis_#t~mem14; 9641#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := lis_#t~post13 + 1;havoc lis_#t~post13; 9627#L551-4 [2018-11-10 03:54:26,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1839987910, now seen corresponding path program 2 times [2018-11-10 03:54:26,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:26,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:26,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 47 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 03:54:26,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:26,638 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:26,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:54:26,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:54:26,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:54:26,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 03:54:26,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:26,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-11-10 03:54:26,750 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:26,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash 104174385, now seen corresponding path program 3 times [2018-11-10 03:54:26,750 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:26,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:26,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:26,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 03:54:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:54:26,782 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. cyclomatic complexity: 31 Second operand 19 states. [2018-11-10 03:54:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:27,055 INFO L93 Difference]: Finished difference Result 199 states and 226 transitions. [2018-11-10 03:54:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 03:54:27,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 226 transitions. [2018-11-10 03:54:27,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:27,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 198 states and 225 transitions. [2018-11-10 03:54:27,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-10 03:54:27,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 03:54:27,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 225 transitions. [2018-11-10 03:54:27,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:27,056 INFO L705 BuchiCegarLoop]: Abstraction has 198 states and 225 transitions. [2018-11-10 03:54:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 225 transitions. [2018-11-10 03:54:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2018-11-10 03:54:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 03:54:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2018-11-10 03:54:27,058 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 199 transitions. [2018-11-10 03:54:27,058 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 199 transitions. [2018-11-10 03:54:27,058 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 03:54:27,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 199 transitions. [2018-11-10 03:54:27,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:27,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:27,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:27,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:27,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:27,060 INFO L793 eck$LassoCheckResult]: Stem: 10275#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10231#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 10232#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 10255#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 10233#L545-3 assume true; 10234#L545-1 assume !!(lis_~i~0 < lis_~N); 10267#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 10291#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 10290#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 10235#L545-3 assume true; 10236#L545-1 assume !!(lis_~i~0 < lis_~N); 10223#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 10224#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 10225#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 10228#L545-3 assume true; 10289#L545-1 assume !!(lis_~i~0 < lis_~N); 10288#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 10287#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 10286#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 10285#L545-3 assume true; 10278#L545-1 assume !!(lis_~i~0 < lis_~N); 10281#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 10280#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 10279#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 10277#L545-3 assume true; 10266#L545-1 assume !(lis_~i~0 < lis_~N); 10241#L545-4 lis_~i~0 := 1; 10242#L547-4 assume true; 10259#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10229#L548-4 assume true; 10230#L548-1 assume !!(lis_~j~0 < lis_~i~0); 10314#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 10313#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 10311#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10308#L549-3 assume !lis_#t~short11; 10300#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10297#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 10293#L548-4 assume true; 10292#L548-1 assume !(lis_~j~0 < lis_~i~0); 10271#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 10272#L547-4 assume true; 10260#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10261#L548-4 assume true; 10219#L548-1 assume !!(lis_~j~0 < lis_~i~0); 10220#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 10253#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 10254#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10257#L549-3 assume !lis_#t~short11; 10245#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10222#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 10227#L548-4 assume true; 10373#L548-1 assume !!(lis_~j~0 < lis_~i~0); 10385#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 10384#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 10383#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10381#L549-3 assume !lis_#t~short11; 10375#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10374#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 10372#L548-4 assume true; 10371#L548-1 assume !(lis_~j~0 < lis_~i~0); 10370#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 10369#L547-4 assume true; 10368#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10366#L548-4 assume true; 10360#L548-1 assume !!(lis_~j~0 < lis_~i~0); 10356#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 10355#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 10353#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10348#L549-3 assume !lis_#t~short11; 10343#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10339#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 10337#L548-4 assume true; 10328#L548-1 assume !!(lis_~j~0 < lis_~i~0); 10329#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 10323#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 10320#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10316#L549-3 assume !lis_#t~short11; 10315#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10298#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 10299#L548-4 assume true; 10294#L548-1 assume !(lis_~j~0 < lis_~i~0); 10284#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 10282#L547-4 assume true; 10276#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10226#L548-4 [2018-11-10 03:54:27,060 INFO L795 eck$LassoCheckResult]: Loop: 10226#L548-4 assume true; 10217#L548-1 assume !!(lis_~j~0 < lis_~i~0); 10218#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 10251#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 10252#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10256#L549-3 assume !lis_#t~short11; 10243#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10221#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 10226#L548-4 [2018-11-10 03:54:27,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash 617105442, now seen corresponding path program 14 times [2018-11-10 03:54:27,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:27,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:27,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:27,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:27,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 73 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 03:54:27,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:27,149 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:27,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:54:27,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:54:27,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:54:27,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 105 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 03:54:27,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:27,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-11-10 03:54:27,252 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:27,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 5 times [2018-11-10 03:54:27,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:27,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:27,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:27,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:27,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:27,367 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-10 03:54:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 03:54:27,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:54:27,387 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. cyclomatic complexity: 30 Second operand 17 states. [2018-11-10 03:54:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:27,666 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2018-11-10 03:54:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 03:54:27,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 317 transitions. [2018-11-10 03:54:27,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:27,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 278 states and 316 transitions. [2018-11-10 03:54:27,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-11-10 03:54:27,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-11-10 03:54:27,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 316 transitions. [2018-11-10 03:54:27,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:27,671 INFO L705 BuchiCegarLoop]: Abstraction has 278 states and 316 transitions. [2018-11-10 03:54:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 316 transitions. [2018-11-10 03:54:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 205. [2018-11-10 03:54:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 03:54:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 233 transitions. [2018-11-10 03:54:27,676 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 233 transitions. [2018-11-10 03:54:27,676 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 233 transitions. [2018-11-10 03:54:27,676 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 03:54:27,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 233 transitions. [2018-11-10 03:54:27,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:27,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:27,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:27,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:27,678 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:27,678 INFO L793 eck$LassoCheckResult]: Stem: 11015#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10973#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 10974#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 10996#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 10977#L545-3 assume true; 10978#L545-1 assume !!(lis_~i~0 < lis_~N); 10966#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 10967#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 10971#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 10972#L545-3 assume true; 10979#L545-1 assume !!(lis_~i~0 < lis_~N); 11034#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 11033#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 11032#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 11031#L545-3 assume true; 11030#L545-1 assume !!(lis_~i~0 < lis_~N); 11029#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 11028#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 11027#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 11026#L545-3 assume true; 11017#L545-1 assume !!(lis_~i~0 < lis_~N); 11025#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 11024#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 11022#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 11016#L545-3 assume true; 11012#L545-1 assume !(lis_~i~0 < lis_~N); 10986#L545-4 lis_~i~0 := 1; 10987#L547-4 assume true; 11000#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11001#L548-4 assume true; 11063#L548-1 assume !!(lis_~j~0 < lis_~i~0); 11062#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 11060#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 11056#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11057#L549-3 assume !lis_#t~short11; 11044#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 11045#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 11040#L548-4 assume true; 11041#L548-1 assume !(lis_~j~0 < lis_~i~0); 11010#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 11011#L547-4 assume true; 11087#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11086#L548-4 assume true; 11085#L548-1 assume !!(lis_~j~0 < lis_~i~0); 11084#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 11083#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 11081#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11077#L549-3 assume !lis_#t~short11; 11073#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 11072#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 11064#L548-4 assume true; 11065#L548-1 assume !!(lis_~j~0 < lis_~i~0); 11071#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 11070#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 11069#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11050#L549-3 assume !lis_#t~short11; 11049#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 11042#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 11043#L548-4 assume true; 11037#L548-1 assume !(lis_~j~0 < lis_~i~0); 11038#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 11013#L547-4 assume true; 11002#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11003#L548-4 assume true; 11124#L548-1 assume !!(lis_~j~0 < lis_~i~0); 11123#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 11121#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 11122#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11117#L549-3 assume !lis_#t~short11; 11116#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 11111#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 11112#L548-4 assume true; 11104#L548-1 assume !!(lis_~j~0 < lis_~i~0); 11105#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 11100#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 11101#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11094#L549-3 assume !lis_#t~short11; 11093#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10969#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 10970#L548-4 assume true; 10962#L548-1 assume !!(lis_~j~0 < lis_~i~0); 10963#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 10994#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 10995#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10998#L549-3 assume !lis_#t~short11; 10984#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10965#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 11039#L548-4 assume true; 11023#L548-1 assume !(lis_~j~0 < lis_~i~0); 11021#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 11019#L547-4 assume true; 11018#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10968#L548-4 [2018-11-10 03:54:27,678 INFO L795 eck$LassoCheckResult]: Loop: 10968#L548-4 assume true; 10960#L548-1 assume !!(lis_~j~0 < lis_~i~0); 10961#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 10992#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 10993#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10997#L549-3 assume !lis_#t~short11; 10982#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 10964#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 10968#L548-4 [2018-11-10 03:54:27,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 695241426, now seen corresponding path program 15 times [2018-11-10 03:54:27,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:27,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:27,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 6 proven. 148 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-10 03:54:27,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:27,851 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:54:27,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 03:54:27,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:54:27,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 114 proven. 56 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 03:54:28,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:28,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-11-10 03:54:28,048 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:28,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 6 times [2018-11-10 03:54:28,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:28,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:28,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:28,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 03:54:28,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2018-11-10 03:54:28,095 INFO L87 Difference]: Start difference. First operand 205 states and 233 transitions. cyclomatic complexity: 34 Second operand 25 states. [2018-11-10 03:54:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:28,588 INFO L93 Difference]: Finished difference Result 490 states and 556 transitions. [2018-11-10 03:54:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 03:54:28,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 556 transitions. [2018-11-10 03:54:28,590 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 51 [2018-11-10 03:54:28,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 488 states and 554 transitions. [2018-11-10 03:54:28,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2018-11-10 03:54:28,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-10 03:54:28,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 488 states and 554 transitions. [2018-11-10 03:54:28,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:28,592 INFO L705 BuchiCegarLoop]: Abstraction has 488 states and 554 transitions. [2018-11-10 03:54:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states and 554 transitions. [2018-11-10 03:54:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 319. [2018-11-10 03:54:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-10 03:54:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 361 transitions. [2018-11-10 03:54:28,597 INFO L728 BuchiCegarLoop]: Abstraction has 319 states and 361 transitions. [2018-11-10 03:54:28,597 INFO L608 BuchiCegarLoop]: Abstraction has 319 states and 361 transitions. [2018-11-10 03:54:28,597 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 03:54:28,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 319 states and 361 transitions. [2018-11-10 03:54:28,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:28,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:28,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:28,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:28,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:54:28,599 INFO L793 eck$LassoCheckResult]: Stem: 12061#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12012#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 12013#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 12036#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 12014#L545-3 assume true; 12015#L545-1 assume !!(lis_~i~0 < lis_~N); 12005#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 12006#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 12007#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 12010#L545-3 assume true; 12016#L545-1 assume !!(lis_~i~0 < lis_~N); 12183#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 12182#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 12181#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 12180#L545-3 assume true; 12179#L545-1 assume !!(lis_~i~0 < lis_~N); 12178#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 12177#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 12176#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 12175#L545-3 assume true; 12174#L545-1 assume !!(lis_~i~0 < lis_~N); 12173#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 12172#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 12171#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 12170#L545-3 assume true; 12048#L545-1 assume !(lis_~i~0 < lis_~N); 12049#L545-4 lis_~i~0 := 1; 12165#L547-4 assume true; 12164#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12163#L548-4 assume true; 12162#L548-1 assume !!(lis_~j~0 < lis_~i~0); 12161#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 12160#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 12158#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12154#L549-3 assume !lis_#t~short11; 12150#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 12149#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 12148#L548-4 assume true; 12147#L548-1 assume !(lis_~j~0 < lis_~i~0); 12146#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 12145#L547-4 assume true; 12144#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12143#L548-4 assume true; 12142#L548-1 assume !!(lis_~j~0 < lis_~i~0); 12141#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 12140#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 12138#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12134#L549-3 assume !lis_#t~short11; 12130#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 12129#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 12128#L548-4 assume true; 12127#L548-1 assume !!(lis_~j~0 < lis_~i~0); 12126#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 12125#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 12123#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12119#L549-3 assume !lis_#t~short11; 12115#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 12114#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 12113#L548-4 assume true; 12112#L548-1 assume !(lis_~j~0 < lis_~i~0); 12111#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 12110#L547-4 assume true; 12109#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12108#L548-4 assume true; 12107#L548-1 assume !!(lis_~j~0 < lis_~i~0); 12106#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 12105#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 12103#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12099#L549-3 assume !lis_#t~short11; 12095#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 12094#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 12093#L548-4 assume true; 12092#L548-1 assume !!(lis_~j~0 < lis_~i~0); 12091#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 12090#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 12088#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12084#L549-3 assume !lis_#t~short11; 12080#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 12079#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 12078#L548-4 assume true; 12064#L548-1 assume !!(lis_~j~0 < lis_~i~0); 12077#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 12076#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 12074#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12070#L549-3 assume !lis_#t~short11; 12066#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 12065#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 12063#L548-4 assume true; 12062#L548-1 assume !(lis_~j~0 < lis_~i~0); 12052#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 12053#L547-4 assume true; 12056#L547-1 assume !(lis_~i~0 < lis_~N); 12017#L547-5 lis_~i~0 := 0; 12018#L551-4 [2018-11-10 03:54:28,599 INFO L795 eck$LassoCheckResult]: Loop: 12018#L551-4 assume true; 12039#L551-1 assume !!(lis_~i~0 < lis_~N); 12019#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 12020#L552-1 assume !(lis_~max~0 < lis_#t~mem14);havoc lis_#t~mem14; 12028#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := lis_#t~post13 + 1;havoc lis_#t~post13; 12018#L551-4 [2018-11-10 03:54:28,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:28,599 INFO L82 PathProgramCache]: Analyzing trace with hash 77647739, now seen corresponding path program 3 times [2018-11-10 03:54:28,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:28,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:28,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:28,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:28,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:28,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash 104174385, now seen corresponding path program 4 times [2018-11-10 03:54:28,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:28,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:28,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:28,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:28,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:28,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash -252878857, now seen corresponding path program 1 times [2018-11-10 03:54:28,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:28,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:28,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-10 03:54:28,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:28,903 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:28,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:28,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:28,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-10 03:54:28,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:28,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:28,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 03:54:28,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:28,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:28,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:28,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2018-11-10 03:54:28,986 INFO L477 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 15 treesize of output 12 [2018-11-10 03:54:28,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 03:54:28,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:28,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:28,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:28,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 03:54:29,012 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-10 03:54:29,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 03:54:29,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-11-10 03:54:29,053 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-10 03:54:29,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:54:29,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-11-10 03:54:29,100 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-10 03:54:29,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-10 03:54:29,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-10 03:54:29,179 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-11-10 03:54:29,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-10 03:54:29,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:29,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2018-11-10 03:54:29,254 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-11-10 03:54:29,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 94 [2018-11-10 03:54:29,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:29,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:74 [2018-11-10 03:54:29,373 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-11-10 03:54:29,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 101 [2018-11-10 03:54:29,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:29,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:90 [2018-11-10 03:54:29,467 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-11-10 03:54:29,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,478 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 185 [2018-11-10 03:54:29,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:29,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:105, output treesize:101 [2018-11-10 03:54:29,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2018-11-10 03:54:29,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,747 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2018-11-10 03:54:29,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,775 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,782 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:29,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 85 [2018-11-10 03:54:29,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:29,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:108, output treesize:7 [2018-11-10 03:54:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-10 03:54:29,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:29,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-11-10 03:54:29,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 03:54:29,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-11-10 03:54:29,963 INFO L87 Difference]: Start difference. First operand 319 states and 361 transitions. cyclomatic complexity: 49 Second operand 25 states. [2018-11-10 03:54:31,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:31,115 INFO L93 Difference]: Finished difference Result 549 states and 625 transitions. [2018-11-10 03:54:31,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 03:54:31,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 625 transitions. [2018-11-10 03:54:31,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2018-11-10 03:54:31,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 549 states and 625 transitions. [2018-11-10 03:54:31,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-10 03:54:31,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-10 03:54:31,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 549 states and 625 transitions. [2018-11-10 03:54:31,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:31,121 INFO L705 BuchiCegarLoop]: Abstraction has 549 states and 625 transitions. [2018-11-10 03:54:31,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states and 625 transitions. [2018-11-10 03:54:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 323. [2018-11-10 03:54:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-10 03:54:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 365 transitions. [2018-11-10 03:54:31,128 INFO L728 BuchiCegarLoop]: Abstraction has 323 states and 365 transitions. [2018-11-10 03:54:31,128 INFO L608 BuchiCegarLoop]: Abstraction has 323 states and 365 transitions. [2018-11-10 03:54:31,128 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 03:54:31,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 365 transitions. [2018-11-10 03:54:31,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:31,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:31,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:31,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:31,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:31,131 INFO L793 eck$LassoCheckResult]: Stem: 13288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 13240#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 13264#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 13241#L545-3 assume true; 13242#L545-1 assume !!(lis_~i~0 < lis_~N); 13230#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 13231#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 13236#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 13237#L545-3 assume true; 13243#L545-1 assume !!(lis_~i~0 < lis_~N); 13324#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 13232#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 13233#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 13320#L545-3 assume true; 13319#L545-1 assume !!(lis_~i~0 < lis_~N); 13318#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 13317#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 13316#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 13314#L545-3 assume true; 13315#L545-1 assume !!(lis_~i~0 < lis_~N); 13303#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 13304#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 13296#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 13297#L545-3 assume true; 13276#L545-1 assume !(lis_~i~0 < lis_~N); 13277#L545-4 lis_~i~0 := 1; 13284#L547-4 assume true; 13285#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13417#L548-4 assume true; 13416#L548-1 assume !!(lis_~j~0 < lis_~i~0); 13415#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 13414#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 13412#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13408#L549-3 assume !lis_#t~short11; 13404#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 13403#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 13402#L548-4 assume true; 13401#L548-1 assume !(lis_~j~0 < lis_~i~0); 13400#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 13399#L547-4 assume true; 13398#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13397#L548-4 assume true; 13396#L548-1 assume !!(lis_~j~0 < lis_~i~0); 13395#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 13394#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 13393#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13390#L549-3 assume !lis_#t~short11; 13384#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 13383#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 13382#L548-4 assume true; 13381#L548-1 assume !!(lis_~j~0 < lis_~i~0); 13380#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 13379#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 13378#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13375#L549-3 assume !lis_#t~short11; 13369#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 13368#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 13367#L548-4 assume true; 13366#L548-1 assume !(lis_~j~0 < lis_~i~0); 13365#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 13364#L547-4 assume true; 13363#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13362#L548-4 assume true; 13361#L548-1 assume !!(lis_~j~0 < lis_~i~0); 13360#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 13359#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 13358#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13355#L549-3 assume !lis_#t~short11; 13349#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 13348#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 13347#L548-4 assume true; 13346#L548-1 assume !!(lis_~j~0 < lis_~i~0); 13345#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 13343#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 13342#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13339#L549-3 assume !lis_#t~short11; 13329#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 13327#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 13326#L548-4 assume true; 13299#L548-1 assume !!(lis_~j~0 < lis_~i~0); 13325#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 13322#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 13321#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13312#L549-3 assume !lis_#t~short11; 13305#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 13302#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 13298#L548-4 assume true; 13295#L548-1 assume !(lis_~j~0 < lis_~i~0); 13280#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 13281#L547-4 assume true; 13328#L547-1 assume !(lis_~i~0 < lis_~N); 13244#L547-5 lis_~i~0 := 0; 13245#L551-4 assume true; 13267#L551-1 assume !!(lis_~i~0 < lis_~N); 13246#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 13247#L552-1 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14; 13254#L553 [2018-11-10 03:54:31,131 INFO L795 eck$LassoCheckResult]: Loop: 13254#L553 SUMMARY for call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L553 13287#L553-1 lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 13262#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := lis_#t~post13 + 1;havoc lis_#t~post13; 13263#L551-4 assume true; 13291#L551-1 assume !!(lis_~i~0 < lis_~N); 13290#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 13289#L552-1 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14; 13254#L553 [2018-11-10 03:54:31,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:31,131 INFO L82 PathProgramCache]: Analyzing trace with hash 546031939, now seen corresponding path program 1 times [2018-11-10 03:54:31,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:31,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:31,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:31,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:31,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:31,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:31,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1792130820, now seen corresponding path program 1 times [2018-11-10 03:54:31,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:31,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:31,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:31,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:31,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:31,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:31,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1009739650, now seen corresponding path program 1 times [2018-11-10 03:54:31,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:31,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:31,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:31,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:31,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 13 proven. 161 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 03:54:32,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:32,706 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:54:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:32,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:32,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-10 03:54:32,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:32,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:32,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 03:54:32,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2018-11-10 03:54:32,798 INFO L477 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 15 treesize of output 12 [2018-11-10 03:54:32,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 03:54:32,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 03:54:32,843 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-10 03:54:32,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 03:54:32,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-11-10 03:54:32,923 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-10 03:54:32,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:32,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-10 03:54:32,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-10 03:54:32,972 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-10 03:54:32,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:32,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:32,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-10 03:54:32,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:32,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2018-11-10 03:54:33,083 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-11-10 03:54:33,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,087 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-11-10 03:54:33,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:33,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:33,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:33,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2018-11-10 03:54:33,162 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-11-10 03:54:33,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 104 [2018-11-10 03:54:33,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:33,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:33,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 03:54:33,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:82, output treesize:78 [2018-11-10 03:54:33,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 72 [2018-11-10 03:54:33,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 64 [2018-11-10 03:54:33,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:33,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:54:33,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 45 [2018-11-10 03:54:33,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:54:33,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:33,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:54:33,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:98, output treesize:7 [2018-11-10 03:54:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-10 03:54:33,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:54:33,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 43 [2018-11-10 03:54:33,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 03:54:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1765, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 03:54:33,992 INFO L87 Difference]: Start difference. First operand 323 states and 365 transitions. cyclomatic complexity: 49 Second operand 44 states. [2018-11-10 03:54:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:39,387 INFO L93 Difference]: Finished difference Result 806 states and 913 transitions. [2018-11-10 03:54:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-10 03:54:39,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 806 states and 913 transitions. [2018-11-10 03:54:39,389 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2018-11-10 03:54:39,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 806 states to 806 states and 913 transitions. [2018-11-10 03:54:39,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2018-11-10 03:54:39,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2018-11-10 03:54:39,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 806 states and 913 transitions. [2018-11-10 03:54:39,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:39,391 INFO L705 BuchiCegarLoop]: Abstraction has 806 states and 913 transitions. [2018-11-10 03:54:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states and 913 transitions. [2018-11-10 03:54:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 533. [2018-11-10 03:54:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-10 03:54:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 607 transitions. [2018-11-10 03:54:39,398 INFO L728 BuchiCegarLoop]: Abstraction has 533 states and 607 transitions. [2018-11-10 03:54:39,398 INFO L608 BuchiCegarLoop]: Abstraction has 533 states and 607 transitions. [2018-11-10 03:54:39,399 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 03:54:39,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 533 states and 607 transitions. [2018-11-10 03:54:39,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:39,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:39,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:39,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:39,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:39,401 INFO L793 eck$LassoCheckResult]: Stem: 14893#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 14844#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 14870#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 14847#L545-3 assume true; 14848#L545-1 assume !!(lis_~i~0 < lis_~N); 14835#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 14836#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 14909#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 14903#L545-3 assume true; 14904#L545-1 assume !!(lis_~i~0 < lis_~N); 14910#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 14839#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 14840#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 14842#L545-3 assume true; 14908#L545-1 assume !!(lis_~i~0 < lis_~N); 14907#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 14906#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 14905#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 14849#L545-3 assume true; 14850#L545-1 assume !!(lis_~i~0 < lis_~N); 15047#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 15046#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 14898#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 14899#L545-3 assume true; 14897#L545-1 assume !!(lis_~i~0 < lis_~N); 14902#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 14900#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 14901#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 14895#L545-3 assume true; 14896#L545-1 assume !(lis_~i~0 < lis_~N); 14857#L545-4 lis_~i~0 := 1; 14858#L547-4 assume true; 14876#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14877#L548-4 assume true; 15082#L548-1 assume !!(lis_~j~0 < lis_~i~0); 15081#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 15080#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 15078#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15074#L549-3 assume !lis_#t~short11; 15069#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 15070#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 15049#L548-4 assume true; 15050#L548-1 assume !(lis_~j~0 < lis_~i~0); 15110#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 15111#L547-4 assume true; 15106#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15107#L548-4 assume true; 15102#L548-1 assume !!(lis_~j~0 < lis_~i~0); 15103#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 15098#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 15099#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15089#L549-3 assume !lis_#t~short11; 15088#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 15287#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 15286#L548-4 assume true; 15276#L548-1 assume !!(lis_~j~0 < lis_~i~0); 15285#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 15284#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 15283#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15280#L549-3 assume !lis_#t~short11; 15278#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 15277#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 15275#L548-4 assume true; 15274#L548-1 assume !(lis_~j~0 < lis_~i~0); 15273#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 15272#L547-4 assume true; 15271#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15270#L548-4 assume true; 15269#L548-1 assume !!(lis_~j~0 < lis_~i~0); 15268#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 15267#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 15266#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15263#L549-3 assume !lis_#t~short11; 15260#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 15259#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 15258#L548-4 assume true; 15257#L548-1 assume !!(lis_~j~0 < lis_~i~0); 15256#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 15255#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 15254#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15251#L549-3 assume !lis_#t~short11; 15248#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 15247#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 15246#L548-4 assume true; 15218#L548-1 assume !!(lis_~j~0 < lis_~i~0); 15219#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 15213#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 15214#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15207#L549-3 assume !lis_#t~short11; 15206#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 15200#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 15201#L548-4 assume true; 15135#L548-1 assume !(lis_~j~0 < lis_~i~0); 15133#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 15130#L547-4 assume true; 14912#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14837#L548-4 [2018-11-10 03:54:39,401 INFO L795 eck$LassoCheckResult]: Loop: 14837#L548-4 assume true; 14828#L548-1 assume !!(lis_~j~0 < lis_~i~0); 14829#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 14865#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 14866#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14871#L549-3 assume !lis_#t~short11; 14853#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 14832#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 14837#L548-4 [2018-11-10 03:54:39,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1551721928, now seen corresponding path program 16 times [2018-11-10 03:54:39,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:39,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:39,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:39,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 7 times [2018-11-10 03:54:39,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:39,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:39,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:39,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -712415096, now seen corresponding path program 17 times [2018-11-10 03:54:39,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:39,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:39,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:45,730 WARN L179 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 391 DAG size of output: 277 [2018-11-10 03:54:46,249 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-11-10 03:54:46,252 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:46,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:46,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:46,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:46,252 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:54:46,252 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:46,252 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:46,252 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:46,252 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration21_Lasso [2018-11-10 03:54:46,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:46,253 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:46,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:46,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:47,503 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 139 [2018-11-10 03:54:47,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:47,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:47,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:47,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:47,753 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-11-10 03:54:48,010 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:48,010 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:54:48,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:48,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:48,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:48,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:48,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:48,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:48,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:48,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:48,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:48,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:48,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:48,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:48,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:48,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:48,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:48,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:48,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:48,061 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:54:48,074 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:54:48,074 INFO L444 ModelExtractionUtils]: 65 out of 70 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 03:54:48,074 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:54:48,075 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:54:48,075 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:54:48,075 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 7 Supporting invariants [] [2018-11-10 03:54:48,572 INFO L297 tatePredicateManager]: 101 out of 104 supporting invariants were superfluous and have been removed [2018-11-10 03:54:48,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:48,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:48,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:48,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2018-11-10 03:54:48,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 533 states and 607 transitions. cyclomatic complexity: 85 Second operand 9 states. [2018-11-10 03:54:48,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 533 states and 607 transitions. cyclomatic complexity: 85. Second operand 9 states. Result 533 states and 607 transitions. Complement of second has 5 states. [2018-11-10 03:54:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 03:54:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 03:54:48,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 97 letters. Loop has 8 letters. [2018-11-10 03:54:48,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:48,721 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:54:48,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:48,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:48,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:48,852 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2018-11-10 03:54:48,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 533 states and 607 transitions. cyclomatic complexity: 85 Second operand 9 states. [2018-11-10 03:54:48,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 533 states and 607 transitions. cyclomatic complexity: 85. Second operand 9 states. Result 533 states and 607 transitions. Complement of second has 5 states. [2018-11-10 03:54:48,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:54:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 03:54:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 03:54:48,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 97 letters. Loop has 8 letters. [2018-11-10 03:54:48,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:48,875 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:54:48,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:48,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:48,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:54:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:48,984 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2018-11-10 03:54:48,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 533 states and 607 transitions. cyclomatic complexity: 85 Second operand 9 states. [2018-11-10 03:54:49,161 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 533 states and 607 transitions. cyclomatic complexity: 85. Second operand 9 states. Result 735 states and 846 transitions. Complement of second has 15 states. [2018-11-10 03:54:49,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 03:54:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 03:54:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2018-11-10 03:54:49,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 152 transitions. Stem has 97 letters. Loop has 8 letters. [2018-11-10 03:54:49,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:49,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 152 transitions. Stem has 105 letters. Loop has 8 letters. [2018-11-10 03:54:49,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:49,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 152 transitions. Stem has 97 letters. Loop has 16 letters. [2018-11-10 03:54:49,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:54:49,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 735 states and 846 transitions. [2018-11-10 03:54:49,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:49,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 735 states to 631 states and 721 transitions. [2018-11-10 03:54:49,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-11-10 03:54:49,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-10 03:54:49,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 631 states and 721 transitions. [2018-11-10 03:54:49,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:49,168 INFO L705 BuchiCegarLoop]: Abstraction has 631 states and 721 transitions. [2018-11-10 03:54:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states and 721 transitions. [2018-11-10 03:54:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 621. [2018-11-10 03:54:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-10 03:54:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 711 transitions. [2018-11-10 03:54:49,174 INFO L728 BuchiCegarLoop]: Abstraction has 621 states and 711 transitions. [2018-11-10 03:54:49,174 INFO L608 BuchiCegarLoop]: Abstraction has 621 states and 711 transitions. [2018-11-10 03:54:49,174 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 03:54:49,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 621 states and 711 transitions. [2018-11-10 03:54:49,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 03:54:49,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:49,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:49,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:49,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:49,177 INFO L793 eck$LassoCheckResult]: Stem: 18669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18616#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 18617#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 18642#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 18620#L545-3 assume true; 18621#L545-1 assume !!(lis_~i~0 < lis_~N); 18699#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 18697#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 18696#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 18622#L545-3 assume true; 18623#L545-1 assume !!(lis_~i~0 < lis_~N); 18608#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 18609#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 18612#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 18615#L545-3 assume true; 18695#L545-1 assume !!(lis_~i~0 < lis_~N); 18694#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 18692#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 18690#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 18688#L545-3 assume true; 18686#L545-1 assume !!(lis_~i~0 < lis_~N); 18684#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 18681#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 18677#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 18673#L545-3 assume true; 18663#L545-1 assume !(lis_~i~0 < lis_~N); 18630#L545-4 lis_~i~0 := 1; 18631#L547-4 assume true; 18816#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18815#L548-4 assume true; 18814#L548-1 assume !!(lis_~j~0 < lis_~i~0); 18813#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 18812#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 18811#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18808#L549-3 assume !lis_#t~short11; 18805#L549-8 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 18804#L550 SUMMARY for call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~j~0 * 4, 4); srcloc: L550 18803#L550-1 SUMMARY for call write~int(lis_#t~mem12 + 1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L550-1 18802#L550-2 havoc lis_#t~mem12; 18801#L550-3 SUMMARY for call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L550-3 18800#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 18799#L548-4 assume true; 18798#L548-1 assume !(lis_~j~0 < lis_~i~0); 18797#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 18796#L547-4 assume true; 18795#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18794#L548-4 assume true; 18792#L548-1 assume !!(lis_~j~0 < lis_~i~0); 18791#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 18790#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 18788#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18785#L549-3 assume !lis_#t~short11; 18781#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 18780#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 18779#L548-4 assume true; 18777#L548-1 assume !!(lis_~j~0 < lis_~i~0); 18776#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 18775#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 18773#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18770#L549-3 assume !lis_#t~short11; 18766#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 18765#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 18764#L548-4 assume true; 18763#L548-1 assume !(lis_~j~0 < lis_~i~0); 18762#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 18761#L547-4 assume true; 18760#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18759#L548-4 assume true; 18757#L548-1 assume !!(lis_~j~0 < lis_~i~0); 18756#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 18755#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 18753#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18750#L549-3 assume !lis_#t~short11; 18746#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 18745#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 18744#L548-4 assume true; 18742#L548-1 assume !!(lis_~j~0 < lis_~i~0); 18741#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 18740#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 18738#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18735#L549-3 assume !lis_#t~short11; 18731#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 18730#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 18729#L548-4 assume true; 18715#L548-1 assume !!(lis_~j~0 < lis_~i~0); 18727#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 18726#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 18724#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18721#L549-3 assume !lis_#t~short11; 18717#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 18716#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 18714#L548-4 assume true; 18602#L548-1 assume !(lis_~j~0 < lis_~i~0); 18603#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 18713#L547-4 assume true; 18709#L547-1 assume !(lis_~i~0 < lis_~N); 18676#L547-5 lis_~i~0 := 0; 18645#L551-4 assume true; 18646#L551-1 assume !!(lis_~i~0 < lis_~N); 18671#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 18701#L552-1 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14; 18667#L553 [2018-11-10 03:54:49,177 INFO L795 eck$LassoCheckResult]: Loop: 18667#L553 SUMMARY for call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L553 18668#L553-1 lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 18633#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := lis_#t~post13 + 1;havoc lis_#t~post13; 18693#L551-4 assume true; 18691#L551-1 assume !!(lis_~i~0 < lis_~N); 18689#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 18687#L552-1 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14; 18667#L553 [2018-11-10 03:54:49,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:49,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1295037127, now seen corresponding path program 1 times [2018-11-10 03:54:49,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:49,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:49,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 03:54:49,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:49,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:54:49,225 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:54:49,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1792130820, now seen corresponding path program 2 times [2018-11-10 03:54:49,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:49,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:54:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:54:49,268 INFO L87 Difference]: Start difference. First operand 621 states and 711 transitions. cyclomatic complexity: 103 Second operand 3 states. [2018-11-10 03:54:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:49,275 INFO L93 Difference]: Finished difference Result 656 states and 746 transitions. [2018-11-10 03:54:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:54:49,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 746 transitions. [2018-11-10 03:54:49,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 03:54:49,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 746 transitions. [2018-11-10 03:54:49,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-10 03:54:49,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-11-10 03:54:49,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 746 transitions. [2018-11-10 03:54:49,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:54:49,280 INFO L705 BuchiCegarLoop]: Abstraction has 656 states and 746 transitions. [2018-11-10 03:54:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 746 transitions. [2018-11-10 03:54:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2018-11-10 03:54:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-10 03:54:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 746 transitions. [2018-11-10 03:54:49,290 INFO L728 BuchiCegarLoop]: Abstraction has 656 states and 746 transitions. [2018-11-10 03:54:49,290 INFO L608 BuchiCegarLoop]: Abstraction has 656 states and 746 transitions. [2018-11-10 03:54:49,290 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 03:54:49,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 656 states and 746 transitions. [2018-11-10 03:54:49,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 03:54:49,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:54:49,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:54:49,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:49,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:49,292 INFO L793 eck$LassoCheckResult]: Stem: 19950#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 19899#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 19900#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 19924#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 19903#L545-3 assume true; 19904#L545-1 assume !!(lis_~i~0 < lis_~N); 19891#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 19892#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 19895#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 19898#L545-3 assume true; 19905#L545-1 assume !!(lis_~i~0 < lis_~N); 19979#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 19978#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 19977#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 19976#L545-3 assume true; 19975#L545-1 assume !!(lis_~i~0 < lis_~N); 19974#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 19973#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 19972#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 19971#L545-3 assume true; 19969#L545-1 assume !!(lis_~i~0 < lis_~N); 19967#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 19965#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 19962#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 19963#L545-3 assume true; 20206#L545-1 assume !(lis_~i~0 < lis_~N); 20205#L545-4 lis_~i~0 := 1; 20204#L547-4 assume true; 20203#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20202#L548-4 assume true; 20201#L548-1 assume !!(lis_~j~0 < lis_~i~0); 20200#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 20199#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 20198#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20197#L549-3 assume lis_#t~short11; 20196#L549-4 SUMMARY for call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L549-4 20194#L549-5 SUMMARY for call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~j~0 * 4, 4); srcloc: L549-5 20192#L549-6 lis_#t~short11 := lis_#t~mem10 < lis_#t~mem9 + 1; 20189#L549-8 assume lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 20187#L550 SUMMARY for call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~j~0 * 4, 4); srcloc: L550 20185#L550-1 SUMMARY for call write~int(lis_#t~mem12 + 1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L550-1 20183#L550-2 havoc lis_#t~mem12; 20181#L550-3 SUMMARY for call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L550-3 20179#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 20177#L548-4 assume true; 20175#L548-1 assume !(lis_~j~0 < lis_~i~0); 20173#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 20171#L547-4 assume true; 20169#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20167#L548-4 assume true; 20165#L548-1 assume !!(lis_~j~0 < lis_~i~0); 20163#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 20161#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 20159#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20157#L549-3 assume !lis_#t~short11; 20139#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 20137#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 20135#L548-4 assume true; 20133#L548-1 assume !!(lis_~j~0 < lis_~i~0); 20131#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 20129#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 20127#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20125#L549-3 assume !lis_#t~short11; 20107#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 20105#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 20103#L548-4 assume true; 20101#L548-1 assume !(lis_~j~0 < lis_~i~0); 20099#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 20097#L547-4 assume true; 20095#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20093#L548-4 assume true; 20091#L548-1 assume !!(lis_~j~0 < lis_~i~0); 20089#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 20087#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 20085#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20083#L549-3 assume !lis_#t~short11; 20065#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 20063#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 20061#L548-4 assume true; 20059#L548-1 assume !!(lis_~j~0 < lis_~i~0); 20057#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 20055#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 20053#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20051#L549-3 assume !lis_#t~short11; 20033#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 20032#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 20031#L548-4 assume true; 20016#L548-1 assume !!(lis_~j~0 < lis_~i~0); 20030#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 20029#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 20028#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20027#L549-3 assume !lis_#t~short11; 20018#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 20017#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 20015#L548-4 assume true; 20014#L548-1 assume !(lis_~j~0 < lis_~i~0); 20013#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 20005#L547-4 assume true; 20003#L547-1 assume !(lis_~i~0 < lis_~N); 19901#L547-5 lis_~i~0 := 0; 19902#L551-4 assume true; 19994#L551-1 assume !!(lis_~i~0 < lis_~N); 19995#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 19981#L552-1 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14; 19982#L553 [2018-11-10 03:54:49,292 INFO L795 eck$LassoCheckResult]: Loop: 19982#L553 SUMMARY for call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L553 19951#L553-1 lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 19913#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := lis_#t~post13 + 1;havoc lis_#t~post13; 19927#L551-4 assume true; 19928#L551-1 assume !!(lis_~i~0 < lis_~N); 19906#L552 SUMMARY for call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L552 19907#L552-1 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14; 19982#L553 [2018-11-10 03:54:49,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:49,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1586859766, now seen corresponding path program 1 times [2018-11-10 03:54:49,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:49,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:49,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:49,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1792130820, now seen corresponding path program 3 times [2018-11-10 03:54:49,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:49,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:49,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1140825489, now seen corresponding path program 1 times [2018-11-10 03:54:49,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:54:49,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:54:49,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:54:49,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:54:56,799 WARN L179 SmtUtils]: Spent 7.28 s on a formula simplification. DAG size of input: 420 DAG size of output: 298 [2018-11-10 03:54:57,883 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 164 [2018-11-10 03:54:57,885 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:54:57,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:54:57,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:54:57,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:54:57,886 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:54:57,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:54:57,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:54:57,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:54:57,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration23_Lasso [2018-11-10 03:54:57,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:54:57,886 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:54:57,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:57,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:54:59,198 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 135 [2018-11-10 03:54:59,428 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-11-10 03:54:59,690 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:54:59,690 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:54:59,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:59,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:59,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:59,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:59,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:59,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:59,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:59,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:59,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:54:59,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:54:59,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:54:59,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,724 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:54:59,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,725 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:54:59,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:59,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:59,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:59,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:59,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:59,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:54:59,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:54:59,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:54:59,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:54:59,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:54:59,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:54:59,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:54:59,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:54:59,754 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:54:59,776 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 03:54:59,776 INFO L444 ModelExtractionUtils]: 62 out of 70 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 03:54:59,776 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:54:59,777 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:54:59,777 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:54:59,777 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2018-11-10 03:55:00,130 INFO L297 tatePredicateManager]: 74 out of 74 supporting invariants were superfluous and have been removed [2018-11-10 03:55:00,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:00,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:00,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:00,176 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:55:00,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 656 states and 746 transitions. cyclomatic complexity: 103 Second operand 5 states. [2018-11-10 03:55:00,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 656 states and 746 transitions. cyclomatic complexity: 103. Second operand 5 states. Result 669 states and 762 transitions. Complement of second has 6 states. [2018-11-10 03:55:00,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:55:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-11-10 03:55:00,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 104 letters. Loop has 7 letters. [2018-11-10 03:55:00,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:00,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 111 letters. Loop has 7 letters. [2018-11-10 03:55:00,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:00,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 104 letters. Loop has 14 letters. [2018-11-10 03:55:00,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:00,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 669 states and 762 transitions. [2018-11-10 03:55:00,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:00,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 669 states to 421 states and 481 transitions. [2018-11-10 03:55:00,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:55:00,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 03:55:00,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 421 states and 481 transitions. [2018-11-10 03:55:00,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:00,192 INFO L705 BuchiCegarLoop]: Abstraction has 421 states and 481 transitions. [2018-11-10 03:55:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states and 481 transitions. [2018-11-10 03:55:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 265. [2018-11-10 03:55:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 03:55:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 298 transitions. [2018-11-10 03:55:00,196 INFO L728 BuchiCegarLoop]: Abstraction has 265 states and 298 transitions. [2018-11-10 03:55:00,196 INFO L608 BuchiCegarLoop]: Abstraction has 265 states and 298 transitions. [2018-11-10 03:55:00,196 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-10 03:55:00,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 298 transitions. [2018-11-10 03:55:00,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:00,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:00,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:00,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:00,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:00,198 INFO L793 eck$LassoCheckResult]: Stem: 21913#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 21876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 21877#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 21895#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 21878#L545-3 assume true; 21879#L545-1 assume !!(lis_~i~0 < lis_~N); 21870#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 21871#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 21874#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 21875#L545-3 assume true; 21880#L545-1 assume !!(lis_~i~0 < lis_~N); 21937#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 21936#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 21934#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 21931#L545-3 assume true; 21930#L545-1 assume !!(lis_~i~0 < lis_~N); 21929#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 21928#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 21927#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 21926#L545-3 assume true; 21925#L545-1 assume !!(lis_~i~0 < lis_~N); 21924#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 21923#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 21922#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 21921#L545-3 assume true; 21916#L545-1 assume !!(lis_~i~0 < lis_~N); 21920#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 21919#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 21918#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 21915#L545-3 assume true; 21910#L545-1 assume !(lis_~i~0 < lis_~N); 21883#L545-4 lis_~i~0 := 1; 21884#L547-4 assume true; 21900#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21901#L548-4 assume true; 22122#L548-1 assume !!(lis_~j~0 < lis_~i~0); 22121#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 22120#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 22119#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22116#L549-3 assume !lis_#t~short11; 22056#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 22054#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 22052#L548-4 assume true; 21956#L548-1 assume !(lis_~j~0 < lis_~i~0); 21908#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 21909#L547-4 assume true; 21902#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21903#L548-4 assume true; 22110#L548-1 assume !!(lis_~j~0 < lis_~i~0); 21914#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 21893#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 21894#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21897#L549-3 assume !lis_#t~short11; 21882#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 21869#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 21873#L548-4 assume true; 21865#L548-1 assume !!(lis_~j~0 < lis_~i~0); 21866#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 22076#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 22075#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22071#L549-3 assume !lis_#t~short11; 22073#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 22113#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 22112#L548-4 assume true; 22111#L548-1 assume !(lis_~j~0 < lis_~i~0); 22109#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 22108#L547-4 assume true; 22107#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22106#L548-4 assume true; 22105#L548-1 assume !!(lis_~j~0 < lis_~i~0); 22104#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 22103#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 22101#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22098#L549-3 assume !lis_#t~short11; 22097#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 22095#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 22094#L548-4 assume true; 22093#L548-1 assume !!(lis_~j~0 < lis_~i~0); 22092#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 22091#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 22089#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22086#L549-3 assume !lis_#t~short11; 22082#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 22079#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 22078#L548-4 assume true; 22044#L548-1 assume !!(lis_~j~0 < lis_~i~0); 22068#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 22066#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 22063#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22061#L549-3 assume !lis_#t~short11; 22046#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 22045#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 22043#L548-4 assume true; 22042#L548-1 assume !(lis_~j~0 < lis_~i~0); 22041#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 22040#L547-4 assume true; 22039#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22038#L548-4 assume true; 22037#L548-1 assume !!(lis_~j~0 < lis_~i~0); 22036#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 22034#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 22031#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22027#L549-3 assume !lis_#t~short11; 22020#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 22017#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 22013#L548-4 assume true; 22006#L548-1 assume !!(lis_~j~0 < lis_~i~0); 22004#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 22002#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 21999#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21995#L549-3 assume !lis_#t~short11; 21988#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 21985#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 21981#L548-4 assume true; 21966#L548-1 assume !!(lis_~j~0 < lis_~i~0); 21972#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 21971#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 21970#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21957#L549-3 assume !lis_#t~short11; 21959#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 21941#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 21942#L548-4 assume true; 21938#L548-1 assume !(lis_~j~0 < lis_~i~0); 21935#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 21932#L547-4 assume true; 21917#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21872#L548-4 [2018-11-10 03:55:00,198 INFO L795 eck$LassoCheckResult]: Loop: 21872#L548-4 assume true; 21863#L548-1 assume !!(lis_~j~0 < lis_~i~0); 21864#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 21891#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 21892#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21896#L549-3 assume !lis_#t~short11; 21881#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 21867#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 21872#L548-4 [2018-11-10 03:55:00,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2091147679, now seen corresponding path program 18 times [2018-11-10 03:55:00,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:00,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:00,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:00,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:00,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 209 proven. 128 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 03:55:00,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:55:00,341 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:55:00,350 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 03:55:00,405 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-10 03:55:00,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:55:00,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 324 proven. 30 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-10 03:55:00,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:55:00,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-11-10 03:55:00,490 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:55:00,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 8 times [2018-11-10 03:55:00,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:00,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:00,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 03:55:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-11-10 03:55:00,535 INFO L87 Difference]: Start difference. First operand 265 states and 298 transitions. cyclomatic complexity: 39 Second operand 21 states. [2018-11-10 03:55:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:55:00,950 INFO L93 Difference]: Finished difference Result 496 states and 559 transitions. [2018-11-10 03:55:00,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 03:55:00,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 496 states and 559 transitions. [2018-11-10 03:55:00,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:00,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 496 states to 494 states and 557 transitions. [2018-11-10 03:55:00,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-10 03:55:00,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-10 03:55:00,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 557 transitions. [2018-11-10 03:55:00,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:00,958 INFO L705 BuchiCegarLoop]: Abstraction has 494 states and 557 transitions. [2018-11-10 03:55:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 557 transitions. [2018-11-10 03:55:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 333. [2018-11-10 03:55:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-10 03:55:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 375 transitions. [2018-11-10 03:55:00,962 INFO L728 BuchiCegarLoop]: Abstraction has 333 states and 375 transitions. [2018-11-10 03:55:00,962 INFO L608 BuchiCegarLoop]: Abstraction has 333 states and 375 transitions. [2018-11-10 03:55:00,963 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-10 03:55:00,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 375 transitions. [2018-11-10 03:55:00,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:00,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:00,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:00,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:00,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:00,964 INFO L793 eck$LassoCheckResult]: Stem: 23106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 23069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 23070#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 23087#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 23071#L545-3 assume true; 23072#L545-1 assume !!(lis_~i~0 < lis_~N); 23061#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 23062#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 23063#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 23073#L545-3 assume true; 23074#L545-1 assume !!(lis_~i~0 < lis_~N); 23127#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 23125#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 23067#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 23068#L545-3 assume true; 23121#L545-1 assume !!(lis_~i~0 < lis_~N); 23120#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 23119#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 23118#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 23117#L545-3 assume true; 23116#L545-1 assume !!(lis_~i~0 < lis_~N); 23115#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 23114#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 23113#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 23112#L545-3 assume true; 23108#L545-1 assume !!(lis_~i~0 < lis_~N); 23111#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 23110#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 23109#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 23107#L545-3 assume true; 23096#L545-1 assume !(lis_~i~0 < lis_~N); 23075#L545-4 lis_~i~0 := 1; 23076#L547-4 assume true; 23101#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23325#L548-4 assume true; 23324#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23323#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23322#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23319#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23315#L549-3 assume !lis_#t~short11; 23311#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23310#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23143#L548-4 assume true; 23144#L548-1 assume !(lis_~j~0 < lis_~i~0); 23344#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 23343#L547-4 assume true; 23342#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23341#L548-4 assume true; 23340#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23339#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23338#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23337#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23336#L549-3 assume !lis_#t~short11; 23327#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23326#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23306#L548-4 assume true; 23307#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23381#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23380#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23379#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23377#L549-3 assume !lis_#t~short11; 23274#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23275#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23308#L548-4 assume true; 23309#L548-1 assume !(lis_~j~0 < lis_~i~0); 23099#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 23100#L547-4 assume true; 23091#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23066#L548-4 assume true; 23057#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23058#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23085#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23086#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23089#L549-3 assume !lis_#t~short11; 23078#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23060#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23361#L548-4 assume true; 23360#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23359#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23358#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23357#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23356#L549-3 assume !lis_#t~short11; 23347#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23346#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23345#L548-4 assume true; 23268#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23305#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23304#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23302#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23293#L549-3 assume !lis_#t~short11; 23272#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23269#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23267#L548-4 assume true; 23266#L548-1 assume !(lis_~j~0 < lis_~i~0); 23265#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 23264#L547-4 assume true; 23263#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23262#L548-4 assume true; 23261#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23260#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23259#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23257#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23254#L549-3 assume !lis_#t~short11; 23244#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23241#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23237#L548-4 assume true; 23235#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23233#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23231#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23228#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23223#L549-3 assume !lis_#t~short11; 23212#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23209#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23205#L548-4 assume true; 23203#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23201#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23199#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23196#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23191#L549-3 assume !lis_#t~short11; 23180#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23177#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23173#L548-4 assume true; 23158#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23154#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23155#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23150#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23145#L549-3 assume !lis_#t~short11; 23147#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23130#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23131#L548-4 assume true; 23126#L548-1 assume !(lis_~j~0 < lis_~i~0); 23124#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 23122#L547-4 assume true; 23090#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23064#L548-4 [2018-11-10 03:55:00,964 INFO L795 eck$LassoCheckResult]: Loop: 23064#L548-4 assume true; 23055#L548-1 assume !!(lis_~j~0 < lis_~i~0); 23056#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 23083#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 23084#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23088#L549-3 assume !lis_#t~short11; 23077#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 23059#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 23064#L548-4 [2018-11-10 03:55:00,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1088081391, now seen corresponding path program 19 times [2018-11-10 03:55:00,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:00,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:00,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:00,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 20 proven. 311 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-11-10 03:55:01,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:55:01,125 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:55:01,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:01,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 378 proven. 60 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 03:55:01,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:55:01,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2018-11-10 03:55:01,397 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:55:01,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 9 times [2018-11-10 03:55:01,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:01,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:01,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:01,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:01,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 03:55:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2018-11-10 03:55:01,454 INFO L87 Difference]: Start difference. First operand 333 states and 375 transitions. cyclomatic complexity: 48 Second operand 28 states. [2018-11-10 03:55:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:55:02,288 INFO L93 Difference]: Finished difference Result 725 states and 815 transitions. [2018-11-10 03:55:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 03:55:02,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 725 states and 815 transitions. [2018-11-10 03:55:02,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 03:55:02,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 725 states to 429 states and 483 transitions. [2018-11-10 03:55:02,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 03:55:02,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 03:55:02,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 429 states and 483 transitions. [2018-11-10 03:55:02,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:02,291 INFO L705 BuchiCegarLoop]: Abstraction has 429 states and 483 transitions. [2018-11-10 03:55:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states and 483 transitions. [2018-11-10 03:55:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 338. [2018-11-10 03:55:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 03:55:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 380 transitions. [2018-11-10 03:55:02,293 INFO L728 BuchiCegarLoop]: Abstraction has 338 states and 380 transitions. [2018-11-10 03:55:02,293 INFO L608 BuchiCegarLoop]: Abstraction has 338 states and 380 transitions. [2018-11-10 03:55:02,293 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-10 03:55:02,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 380 transitions. [2018-11-10 03:55:02,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:02,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:02,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:02,294 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:02,294 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:02,294 INFO L793 eck$LassoCheckResult]: Stem: 24636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 24597#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 24598#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 24614#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 24599#L545-3 assume true; 24600#L545-1 assume !!(lis_~i~0 < lis_~N); 24591#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 24592#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 24593#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 24596#L545-3 assume true; 24601#L545-1 assume !!(lis_~i~0 < lis_~N); 24629#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 24659#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 24658#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 24657#L545-3 assume true; 24656#L545-1 assume !!(lis_~i~0 < lis_~N); 24655#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 24654#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 24653#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 24652#L545-3 assume true; 24651#L545-1 assume !!(lis_~i~0 < lis_~N); 24650#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 24649#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 24648#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 24647#L545-3 assume true; 24646#L545-1 assume !!(lis_~i~0 < lis_~N); 24645#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 24644#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 24643#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 24642#L545-3 assume true; 24638#L545-1 assume !!(lis_~i~0 < lis_~N); 24641#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 24640#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 24639#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 24637#L545-3 assume true; 24628#L545-1 assume !(lis_~i~0 < lis_~N); 24602#L545-4 lis_~i~0 := 1; 24603#L547-4 assume true; 24617#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24618#L548-4 assume true; 24891#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24890#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24889#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24887#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24883#L549-3 assume !lis_#t~short11; 24855#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24852#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24849#L548-4 assume true; 24824#L548-1 assume !(lis_~j~0 < lis_~i~0); 24825#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 24632#L547-4 assume true; 24633#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24877#L548-4 assume true; 24875#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24873#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24871#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24868#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24865#L549-3 assume !lis_#t~short11; 24843#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24841#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24839#L548-4 assume true; 24837#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24835#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24833#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24831#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24821#L549-3 assume !lis_#t~short11; 24813#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24811#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24808#L548-4 assume true; 24806#L548-1 assume !(lis_~j~0 < lis_~i~0); 24804#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 24801#L547-4 assume true; 24799#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24798#L548-4 assume true; 24797#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24796#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24794#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24792#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24790#L549-3 assume !lis_#t~short11; 24784#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24783#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24782#L548-4 assume true; 24781#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24780#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24779#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24778#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24777#L549-3 assume !lis_#t~short11; 24768#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24767#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24766#L548-4 assume true; 24751#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24765#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24764#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24763#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24762#L549-3 assume !lis_#t~short11; 24753#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24752#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24750#L548-4 assume true; 24749#L548-1 assume !(lis_~j~0 < lis_~i~0); 24748#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 24747#L547-4 assume true; 24746#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24745#L548-4 assume true; 24744#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24743#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24742#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24741#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24740#L549-3 assume !lis_#t~short11; 24731#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24730#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24729#L548-4 assume true; 24728#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24727#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24726#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24725#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24724#L549-3 assume !lis_#t~short11; 24715#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24714#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24713#L548-4 assume true; 24712#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24711#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24710#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24709#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24708#L549-3 assume !lis_#t~short11; 24699#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24698#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24697#L548-4 assume true; 24682#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24696#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24695#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24693#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24689#L549-3 assume !lis_#t~short11; 24686#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24683#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24681#L548-4 assume true; 24663#L548-1 assume !(lis_~j~0 < lis_~i~0); 24662#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 24661#L547-4 assume true; 24660#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24594#L548-4 [2018-11-10 03:55:02,294 INFO L795 eck$LassoCheckResult]: Loop: 24594#L548-4 assume true; 24587#L548-1 assume !!(lis_~j~0 < lis_~i~0); 24588#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 24610#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 24611#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24615#L549-3 assume !lis_#t~short11; 24604#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 24585#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 24594#L548-4 [2018-11-10 03:55:02,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1337548297, now seen corresponding path program 20 times [2018-11-10 03:55:02,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:02,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:02,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:02,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 10 times [2018-11-10 03:55:02,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:02,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:02,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:02,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:02,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1550139719, now seen corresponding path program 21 times [2018-11-10 03:55:02,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:02,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:02,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:02,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:26,801 WARN L179 SmtUtils]: Spent 24.33 s on a formula simplification. DAG size of input: 512 DAG size of output: 357 [2018-11-10 03:55:29,201 WARN L179 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 179 [2018-11-10 03:55:29,203 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:29,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:29,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:29,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:29,203 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:29,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:29,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:29,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:29,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration26_Lasso [2018-11-10 03:55:29,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:29,203 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:29,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:29,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:33,253 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 158 [2018-11-10 03:55:33,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:33,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:33,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:33,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:33,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:33,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:33,512 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-11-10 03:55:33,793 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:33,793 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:33,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:33,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:33,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:33,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:33,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:33,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:33,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:33,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:33,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:33,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:33,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:33,840 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:33,864 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 03:55:33,864 INFO L444 ModelExtractionUtils]: 64 out of 70 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 03:55:33,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:33,865 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:55:33,865 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:33,865 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -10*ULTIMATE.start_lis_~j~0 + 9*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-10 03:55:34,800 INFO L297 tatePredicateManager]: 170 out of 172 supporting invariants were superfluous and have been removed [2018-11-10 03:55:34,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:34,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:34,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:34,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2018-11-10 03:55:34,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 338 states and 380 transitions. cyclomatic complexity: 48 Second operand 10 states. [2018-11-10 03:55:34,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 338 states and 380 transitions. cyclomatic complexity: 48. Second operand 10 states. Result 338 states and 380 transitions. Complement of second has 5 states. [2018-11-10 03:55:34,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 03:55:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 03:55:34,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 139 letters. Loop has 8 letters. [2018-11-10 03:55:34,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:34,947 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:55:34,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:34,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:35,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:35,088 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2018-11-10 03:55:35,088 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 338 states and 380 transitions. cyclomatic complexity: 48 Second operand 10 states. [2018-11-10 03:55:35,112 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 338 states and 380 transitions. cyclomatic complexity: 48. Second operand 10 states. Result 338 states and 380 transitions. Complement of second has 5 states. [2018-11-10 03:55:35,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 03:55:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 03:55:35,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 139 letters. Loop has 8 letters. [2018-11-10 03:55:35,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:35,113 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:55:35,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:35,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:35,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:35,235 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2018-11-10 03:55:35,235 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 338 states and 380 transitions. cyclomatic complexity: 48 Second operand 10 states. [2018-11-10 03:55:35,414 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 338 states and 380 transitions. cyclomatic complexity: 48. Second operand 10 states. Result 506 states and 572 transitions. Complement of second has 17 states. [2018-11-10 03:55:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 03:55:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 03:55:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2018-11-10 03:55:35,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 162 transitions. Stem has 139 letters. Loop has 8 letters. [2018-11-10 03:55:35,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:35,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 162 transitions. Stem has 147 letters. Loop has 8 letters. [2018-11-10 03:55:35,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:35,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 162 transitions. Stem has 139 letters. Loop has 16 letters. [2018-11-10 03:55:35,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:35,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 572 transitions. [2018-11-10 03:55:35,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:35,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 412 states and 463 transitions. [2018-11-10 03:55:35,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:55:35,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 03:55:35,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 463 transitions. [2018-11-10 03:55:35,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:35,420 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 463 transitions. [2018-11-10 03:55:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 463 transitions. [2018-11-10 03:55:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 407. [2018-11-10 03:55:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-10 03:55:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 458 transitions. [2018-11-10 03:55:35,424 INFO L728 BuchiCegarLoop]: Abstraction has 407 states and 458 transitions. [2018-11-10 03:55:35,424 INFO L608 BuchiCegarLoop]: Abstraction has 407 states and 458 transitions. [2018-11-10 03:55:35,424 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-10 03:55:35,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 458 transitions. [2018-11-10 03:55:35,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:35,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:35,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:35,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 14, 14, 14, 14, 14, 14, 14, 7, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:35,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:35,426 INFO L793 eck$LassoCheckResult]: Stem: 28252#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 28215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 28216#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 28232#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 28217#L545-3 assume true; 28218#L545-1 assume !!(lis_~i~0 < lis_~N); 28275#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 28274#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 28212#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 28213#L545-3 assume true; 28219#L545-1 assume !!(lis_~i~0 < lis_~N); 28207#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 28208#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 28209#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 28273#L545-3 assume true; 28272#L545-1 assume !!(lis_~i~0 < lis_~N); 28271#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 28270#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 28269#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 28268#L545-3 assume true; 28267#L545-1 assume !!(lis_~i~0 < lis_~N); 28266#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 28265#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 28264#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 28263#L545-3 assume true; 28262#L545-1 assume !!(lis_~i~0 < lis_~N); 28261#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 28260#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 28259#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 28258#L545-3 assume true; 28254#L545-1 assume !!(lis_~i~0 < lis_~N); 28257#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 28256#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 28255#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 28253#L545-3 assume true; 28243#L545-1 assume !(lis_~i~0 < lis_~N); 28220#L545-4 lis_~i~0 := 1; 28221#L547-4 assume true; 28235#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28214#L548-4 assume true; 28203#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28204#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28230#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28231#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28234#L549-3 assume !lis_#t~short11; 28240#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28564#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28565#L548-4 assume true; 28558#L548-1 assume !(lis_~j~0 < lis_~i~0); 28559#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 28248#L547-4 assume true; 28236#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28237#L548-4 assume true; 28594#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28591#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28590#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28589#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28588#L549-3 assume !lis_#t~short11; 28223#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28206#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28211#L548-4 assume true; 28570#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28566#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28563#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28560#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28556#L549-3 assume !lis_#t~short11; 28549#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28547#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28544#L548-4 assume true; 28542#L548-1 assume !(lis_~j~0 < lis_~i~0); 28540#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 28538#L547-4 assume true; 28535#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28533#L548-4 assume true; 28532#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28531#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28530#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28528#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28525#L549-3 assume !lis_#t~short11; 28519#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28518#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28517#L548-4 assume true; 28516#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28515#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28514#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28512#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28509#L549-3 assume !lis_#t~short11; 28503#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28502#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28501#L548-4 assume true; 28486#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28500#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28499#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28497#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28494#L549-3 assume !lis_#t~short11; 28488#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28487#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28485#L548-4 assume true; 28484#L548-1 assume !(lis_~j~0 < lis_~i~0); 28483#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 28482#L547-4 assume true; 28481#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28480#L548-4 assume true; 28479#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28478#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28477#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28475#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28472#L549-3 assume !lis_#t~short11; 28466#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28465#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28464#L548-4 assume true; 28463#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28462#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28461#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28459#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28456#L549-3 assume !lis_#t~short11; 28450#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28449#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28448#L548-4 assume true; 28447#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28446#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28445#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28443#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28440#L549-3 assume !lis_#t~short11; 28434#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28433#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28432#L548-4 assume true; 28417#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28431#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28430#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28428#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28425#L549-3 assume !lis_#t~short11; 28419#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28418#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28416#L548-4 assume true; 28415#L548-1 assume !(lis_~j~0 < lis_~i~0); 28414#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 28413#L547-4 assume true; 28412#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28411#L548-4 assume true; 28410#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28409#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28408#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28406#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28403#L549-3 assume !lis_#t~short11; 28397#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28396#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28395#L548-4 assume true; 28394#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28393#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28392#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28390#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28387#L549-3 assume !lis_#t~short11; 28377#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28374#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28370#L548-4 assume true; 28368#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28366#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28364#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28361#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28356#L549-3 assume !lis_#t~short11; 28345#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28342#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28338#L548-4 assume true; 28305#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28313#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28301#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28299#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28294#L549-3 assume !lis_#t~short11; 28296#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28283#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28284#L548-4 assume true; 28280#L548-1 assume !(lis_~j~0 < lis_~i~0); 28279#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 28277#L547-4 assume true; 28276#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28210#L548-4 [2018-11-10 03:55:35,427 INFO L795 eck$LassoCheckResult]: Loop: 28210#L548-4 assume true; 28201#L548-1 assume !!(lis_~j~0 < lis_~i~0); 28202#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 28228#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 28229#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 28233#L549-3 assume !lis_#t~short11; 28222#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 28205#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 28210#L548-4 [2018-11-10 03:55:35,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:35,427 INFO L82 PathProgramCache]: Analyzing trace with hash -70490702, now seen corresponding path program 22 times [2018-11-10 03:55:35,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:35,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:35,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:35,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:35,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 483 proven. 238 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-11-10 03:55:35,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:55:35,621 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:55:35,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:55:35,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:55:35,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:55:35,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 772 proven. 56 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-10 03:55:35,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:55:35,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-11-10 03:55:35,833 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:55:35,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 11 times [2018-11-10 03:55:35,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:35,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:35,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 03:55:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-11-10 03:55:35,906 INFO L87 Difference]: Start difference. First operand 407 states and 458 transitions. cyclomatic complexity: 58 Second operand 25 states. [2018-11-10 03:55:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:55:36,638 INFO L93 Difference]: Finished difference Result 824 states and 929 transitions. [2018-11-10 03:55:36,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 03:55:36,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 824 states and 929 transitions. [2018-11-10 03:55:36,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:36,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 824 states to 821 states and 926 transitions. [2018-11-10 03:55:36,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2018-11-10 03:55:36,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-11-10 03:55:36,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 821 states and 926 transitions. [2018-11-10 03:55:36,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:36,641 INFO L705 BuchiCegarLoop]: Abstraction has 821 states and 926 transitions. [2018-11-10 03:55:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states and 926 transitions. [2018-11-10 03:55:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 544. [2018-11-10 03:55:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-10 03:55:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 613 transitions. [2018-11-10 03:55:36,646 INFO L728 BuchiCegarLoop]: Abstraction has 544 states and 613 transitions. [2018-11-10 03:55:36,646 INFO L608 BuchiCegarLoop]: Abstraction has 544 states and 613 transitions. [2018-11-10 03:55:36,646 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-10 03:55:36,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 544 states and 613 transitions. [2018-11-10 03:55:36,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:36,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:36,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:36,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 15, 15, 15, 15, 15, 15, 15, 7, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:36,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:36,648 INFO L793 eck$LassoCheckResult]: Stem: 30081#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30045#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 30046#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 30063#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 30047#L545-3 assume true; 30048#L545-1 assume !!(lis_~i~0 < lis_~N); 30037#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 30038#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 30039#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 30049#L545-3 assume true; 30050#L545-1 assume !!(lis_~i~0 < lis_~N); 30108#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 30106#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 30043#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 30044#L545-3 assume true; 30101#L545-1 assume !!(lis_~i~0 < lis_~N); 30100#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 30099#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 30098#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 30097#L545-3 assume true; 30096#L545-1 assume !!(lis_~i~0 < lis_~N); 30095#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 30094#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 30093#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 30092#L545-3 assume true; 30091#L545-1 assume !!(lis_~i~0 < lis_~N); 30090#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 30089#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 30088#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 30087#L545-3 assume true; 30083#L545-1 assume !!(lis_~i~0 < lis_~N); 30086#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 30085#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 30084#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 30082#L545-3 assume true; 30073#L545-1 assume !(lis_~i~0 < lis_~N); 30051#L545-4 lis_~i~0 := 1; 30052#L547-4 assume true; 30066#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 30067#L548-4 assume true; 30471#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30470#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30469#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30468#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30465#L549-3 assume !lis_#t~short11; 30458#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30457#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30456#L548-4 assume true; 30455#L548-1 assume !(lis_~j~0 < lis_~i~0); 30454#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 30453#L547-4 assume true; 30452#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 30451#L548-4 assume true; 30450#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30449#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30448#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30446#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30443#L549-3 assume !lis_#t~short11; 30437#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30436#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30435#L548-4 assume true; 30434#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30433#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30432#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30430#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30427#L549-3 assume !lis_#t~short11; 30421#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30420#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30418#L548-4 assume true; 30417#L548-1 assume !(lis_~j~0 < lis_~i~0); 30416#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 30415#L547-4 assume true; 30414#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 30413#L548-4 assume true; 30412#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30411#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30410#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30408#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30405#L549-3 assume !lis_#t~short11; 30399#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30398#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30397#L548-4 assume true; 30396#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30395#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30394#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30392#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30389#L549-3 assume !lis_#t~short11; 30383#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30382#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30381#L548-4 assume true; 30380#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30379#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30377#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30374#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30370#L549-3 assume !lis_#t~short11; 30358#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30354#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30351#L548-4 assume true; 30349#L548-1 assume !(lis_~j~0 < lis_~i~0); 30347#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 30345#L547-4 assume true; 30342#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 30340#L548-4 assume true; 30339#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30338#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30337#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30335#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30332#L549-3 assume !lis_#t~short11; 30326#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30325#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30324#L548-4 assume true; 30323#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30322#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30321#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30319#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30316#L549-3 assume !lis_#t~short11; 30310#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30309#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30308#L548-4 assume true; 30307#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30306#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30305#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30303#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30300#L549-3 assume !lis_#t~short11; 30294#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30293#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30292#L548-4 assume true; 30277#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30291#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30290#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30289#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30288#L549-3 assume !lis_#t~short11; 30279#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30278#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30276#L548-4 assume true; 30275#L548-1 assume !(lis_~j~0 < lis_~i~0); 30274#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 30273#L547-4 assume true; 30272#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 30271#L548-4 assume true; 30270#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30269#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30268#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30266#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30263#L549-3 assume !lis_#t~short11; 30257#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30256#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30255#L548-4 assume true; 30254#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30253#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30252#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30250#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30247#L549-3 assume !lis_#t~short11; 30241#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30240#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30239#L548-4 assume true; 30238#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30237#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30236#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30234#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30231#L549-3 assume !lis_#t~short11; 30225#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30224#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30223#L548-4 assume true; 30222#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30221#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30220#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30218#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30215#L549-3 assume !lis_#t~short11; 30209#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30208#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30207#L548-4 assume true; 30133#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30141#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30140#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30139#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30120#L549-3 assume !lis_#t~short11; 30122#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30111#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30112#L548-4 assume true; 30107#L548-1 assume !(lis_~j~0 < lis_~i~0); 30105#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 30102#L547-4 assume true; 30103#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 30040#L548-4 [2018-11-10 03:55:36,648 INFO L795 eck$LassoCheckResult]: Loop: 30040#L548-4 assume true; 30031#L548-1 assume !!(lis_~j~0 < lis_~i~0); 30032#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 30059#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 30060#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 30064#L549-3 assume !lis_#t~short11; 30053#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 30035#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 30040#L548-4 [2018-11-10 03:55:36,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:36,649 INFO L82 PathProgramCache]: Analyzing trace with hash -477751198, now seen corresponding path program 23 times [2018-11-10 03:55:36,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:36,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:36,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:36,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 42 proven. 569 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-11-10 03:55:36,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:55:36,832 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:55:36,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 03:55:36,931 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-10 03:55:36,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:55:36,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 728 proven. 229 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-10 03:55:37,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:55:37,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2018-11-10 03:55:37,125 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:55:37,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 12 times [2018-11-10 03:55:37,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:37,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:37,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:37,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 03:55:37,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 03:55:37,164 INFO L87 Difference]: Start difference. First operand 544 states and 613 transitions. cyclomatic complexity: 76 Second operand 33 states. [2018-11-10 03:55:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:55:38,297 INFO L93 Difference]: Finished difference Result 1228 states and 1382 transitions. [2018-11-10 03:55:38,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-10 03:55:38,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1382 transitions. [2018-11-10 03:55:38,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 03:55:38,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 656 states and 739 transitions. [2018-11-10 03:55:38,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 03:55:38,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 03:55:38,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 739 transitions. [2018-11-10 03:55:38,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:38,303 INFO L705 BuchiCegarLoop]: Abstraction has 656 states and 739 transitions. [2018-11-10 03:55:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 739 transitions. [2018-11-10 03:55:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 549. [2018-11-10 03:55:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-11-10 03:55:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 618 transitions. [2018-11-10 03:55:38,308 INFO L728 BuchiCegarLoop]: Abstraction has 549 states and 618 transitions. [2018-11-10 03:55:38,308 INFO L608 BuchiCegarLoop]: Abstraction has 549 states and 618 transitions. [2018-11-10 03:55:38,308 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-10 03:55:38,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 549 states and 618 transitions. [2018-11-10 03:55:38,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:55:38,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:38,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:38,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 15, 15, 15, 15, 15, 15, 15, 8, 7, 7, 7, 7, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:38,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:38,311 INFO L793 eck$LassoCheckResult]: Stem: 32502#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 32466#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 32482#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 32467#L545-3 assume true; 32468#L545-1 assume !!(lis_~i~0 < lis_~N); 32458#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 32459#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 32463#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 32464#L545-3 assume true; 32469#L545-1 assume !!(lis_~i~0 < lis_~N); 32534#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 32533#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 32532#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 32531#L545-3 assume true; 32530#L545-1 assume !!(lis_~i~0 < lis_~N); 32529#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 32528#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 32527#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 32526#L545-3 assume true; 32525#L545-1 assume !!(lis_~i~0 < lis_~N); 32524#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 32523#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 32522#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 32521#L545-3 assume true; 32520#L545-1 assume !!(lis_~i~0 < lis_~N); 32519#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 32518#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 32517#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 32516#L545-3 assume true; 32515#L545-1 assume !!(lis_~i~0 < lis_~N); 32514#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 32513#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 32512#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 32511#L545-3 assume true; 32504#L545-1 assume !!(lis_~i~0 < lis_~N); 32508#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 32506#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 32505#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 32503#L545-3 assume true; 32497#L545-1 assume !(lis_~i~0 < lis_~N); 32472#L545-4 lis_~i~0 := 1; 32473#L547-4 assume true; 32487#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 32488#L548-4 assume true; 32948#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32946#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32943#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32938#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32936#L549-3 assume !lis_#t~short11; 32927#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32924#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32920#L548-4 assume true; 32914#L548-1 assume !(lis_~j~0 < lis_~i~0); 32495#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 32496#L547-4 assume true; 32891#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 32887#L548-4 assume true; 32884#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32881#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32877#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32873#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32869#L549-3 assume !lis_#t~short11; 32855#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32853#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32851#L548-4 assume true; 32849#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32847#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32844#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32841#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32837#L549-3 assume !lis_#t~short11; 32823#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32821#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32818#L548-4 assume true; 32816#L548-1 assume !(lis_~j~0 < lis_~i~0); 32814#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 32811#L547-4 assume true; 32809#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 32807#L548-4 assume true; 32805#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32803#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32801#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32797#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32791#L549-3 assume !lis_#t~short11; 32781#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32778#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32776#L548-4 assume true; 32774#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32773#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32771#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32767#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32762#L549-3 assume !lis_#t~short11; 32748#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32746#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32744#L548-4 assume true; 32742#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32740#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32738#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32735#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32731#L549-3 assume !lis_#t~short11; 32717#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32715#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32712#L548-4 assume true; 32710#L548-1 assume !(lis_~j~0 < lis_~i~0); 32708#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 32705#L547-4 assume true; 32703#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 32702#L548-4 assume true; 32701#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32700#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32699#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32698#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32697#L549-3 assume !lis_#t~short11; 32688#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32687#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32686#L548-4 assume true; 32685#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32684#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32683#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32682#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32681#L549-3 assume !lis_#t~short11; 32672#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32671#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32670#L548-4 assume true; 32669#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32668#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32667#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32666#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32665#L549-3 assume !lis_#t~short11; 32656#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32655#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32654#L548-4 assume true; 32639#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32653#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32652#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32651#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32650#L549-3 assume !lis_#t~short11; 32641#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32640#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32638#L548-4 assume true; 32637#L548-1 assume !(lis_~j~0 < lis_~i~0); 32636#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 32635#L547-4 assume true; 32634#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 32633#L548-4 assume true; 32632#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32631#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32630#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32629#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32628#L549-3 assume !lis_#t~short11; 32619#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32618#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32617#L548-4 assume true; 32616#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32615#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32614#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32613#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32612#L549-3 assume !lis_#t~short11; 32603#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32602#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32601#L548-4 assume true; 32600#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32599#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32598#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32597#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32596#L549-3 assume !lis_#t~short11; 32587#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32586#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32585#L548-4 assume true; 32584#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32583#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32582#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32581#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32580#L549-3 assume !lis_#t~short11; 32571#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32570#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32569#L548-4 assume true; 32554#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32567#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32566#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32564#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32560#L549-3 assume !lis_#t~short11; 32556#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32555#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32553#L548-4 assume true; 32535#L548-1 assume !(lis_~j~0 < lis_~i~0); 32510#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 32509#L547-4 assume true; 32507#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 32460#L548-4 [2018-11-10 03:55:38,311 INFO L795 eck$LassoCheckResult]: Loop: 32460#L548-4 assume true; 32452#L548-1 assume !!(lis_~j~0 < lis_~i~0); 32453#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 32478#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 32479#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 32483#L549-3 assume !lis_#t~short11; 32470#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 32456#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 32460#L548-4 [2018-11-10 03:55:38,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1800045256, now seen corresponding path program 24 times [2018-11-10 03:55:38,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:38,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:38,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:38,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:38,361 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 13 times [2018-11-10 03:55:38,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:38,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:38,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1365754136, now seen corresponding path program 25 times [2018-11-10 03:55:38,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:40,748 WARN L179 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 654 DAG size of output: 445 [2018-11-10 03:56:44,127 WARN L179 SmtUtils]: Spent 3.37 s on a formula simplification that was a NOOP. DAG size: 200 [2018-11-10 03:56:44,129 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:56:44,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:56:44,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:56:44,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:56:44,130 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:56:44,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:44,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:56:44,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:56:44,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration29_Lasso [2018-11-10 03:56:44,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:56:44,130 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:56:44,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:44,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,659 WARN L179 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 175 [2018-11-10 03:56:50,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:50,967 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2018-11-10 03:56:51,285 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:56:51,285 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:56:51,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:51,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:51,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:51,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,304 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:56:51,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,305 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:56:51,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,314 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:51,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:51,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:51,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:51,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:51,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:51,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:51,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:51,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:56:51,377 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 03:56:51,377 INFO L444 ModelExtractionUtils]: 63 out of 73 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-10 03:56:51,377 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:56:51,378 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:56:51,378 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:56:51,378 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 11 Supporting invariants [] [2018-11-10 03:56:52,736 INFO L297 tatePredicateManager]: 249 out of 250 supporting invariants were superfluous and have been removed [2018-11-10 03:56:52,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:52,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:52,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:52,832 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2018-11-10 03:56:52,832 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 549 states and 618 transitions. cyclomatic complexity: 76 Second operand 10 states. [2018-11-10 03:56:52,855 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 549 states and 618 transitions. cyclomatic complexity: 76. Second operand 10 states. Result 549 states and 618 transitions. Complement of second has 4 states. [2018-11-10 03:56:52,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:56:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 03:56:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-10 03:56:52,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 189 letters. Loop has 8 letters. [2018-11-10 03:56:52,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:52,856 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:56:52,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:52,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:52,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:52,957 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2018-11-10 03:56:52,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 549 states and 618 transitions. cyclomatic complexity: 76 Second operand 10 states. [2018-11-10 03:56:52,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 549 states and 618 transitions. cyclomatic complexity: 76. Second operand 10 states. Result 549 states and 618 transitions. Complement of second has 4 states. [2018-11-10 03:56:52,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 03:56:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 03:56:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-10 03:56:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 189 letters. Loop has 8 letters. [2018-11-10 03:56:52,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:52,988 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:56:53,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:53,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:53,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:53,116 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2018-11-10 03:56:53,116 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 549 states and 618 transitions. cyclomatic complexity: 76 Second operand 10 states. [2018-11-10 03:56:53,272 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 549 states and 618 transitions. cyclomatic complexity: 76. Second operand 10 states. Result 749 states and 846 transitions. Complement of second has 18 states. [2018-11-10 03:56:53,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 03:56:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 03:56:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2018-11-10 03:56:53,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 184 transitions. Stem has 189 letters. Loop has 8 letters. [2018-11-10 03:56:53,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:53,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 184 transitions. Stem has 197 letters. Loop has 8 letters. [2018-11-10 03:56:53,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:53,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 184 transitions. Stem has 189 letters. Loop has 16 letters. [2018-11-10 03:56:53,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:53,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 749 states and 846 transitions. [2018-11-10 03:56:53,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:56:53,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 749 states to 640 states and 720 transitions. [2018-11-10 03:56:53,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:56:53,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 03:56:53,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 720 transitions. [2018-11-10 03:56:53,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:56:53,276 INFO L705 BuchiCegarLoop]: Abstraction has 640 states and 720 transitions. [2018-11-10 03:56:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 720 transitions. [2018-11-10 03:56:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 634. [2018-11-10 03:56:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-11-10 03:56:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 714 transitions. [2018-11-10 03:56:53,286 INFO L728 BuchiCegarLoop]: Abstraction has 634 states and 714 transitions. [2018-11-10 03:56:53,286 INFO L608 BuchiCegarLoop]: Abstraction has 634 states and 714 transitions. [2018-11-10 03:56:53,286 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-10 03:56:53,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 714 transitions. [2018-11-10 03:56:53,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:56:53,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:56:53,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:56:53,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [26, 20, 20, 20, 20, 20, 20, 20, 8, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-11-10 03:56:53,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:56:53,289 INFO L793 eck$LassoCheckResult]: Stem: 37753#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 37715#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 37716#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 37732#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 37717#L545-3 assume true; 37718#L545-1 assume !!(lis_~i~0 < lis_~N); 37781#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 37780#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 37711#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 37712#L545-3 assume true; 37719#L545-1 assume !!(lis_~i~0 < lis_~N); 37706#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 37707#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 37708#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 37779#L545-3 assume true; 37778#L545-1 assume !!(lis_~i~0 < lis_~N); 37777#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 37776#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 37775#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 37774#L545-3 assume true; 37773#L545-1 assume !!(lis_~i~0 < lis_~N); 37772#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 37771#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 37770#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 37769#L545-3 assume true; 37768#L545-1 assume !!(lis_~i~0 < lis_~N); 37767#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 37766#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 37765#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 37764#L545-3 assume true; 37763#L545-1 assume !!(lis_~i~0 < lis_~N); 37762#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 37761#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 37760#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 37759#L545-3 assume true; 37755#L545-1 assume !!(lis_~i~0 < lis_~N); 37758#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 37757#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 37756#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 37754#L545-3 assume true; 37744#L545-1 assume !(lis_~i~0 < lis_~N); 37720#L545-4 lis_~i~0 := 1; 37721#L547-4 assume true; 37735#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 37736#L548-4 assume true; 38298#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38297#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38296#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38295#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38294#L549-3 assume !lis_#t~short11; 38285#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38284#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38283#L548-4 assume true; 38282#L548-1 assume !(lis_~j~0 < lis_~i~0); 38281#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 38280#L547-4 assume true; 38279#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38278#L548-4 assume true; 38277#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38276#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38275#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38273#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38270#L549-3 assume !lis_#t~short11; 38258#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38254#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38252#L548-4 assume true; 38250#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38248#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38246#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38242#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38238#L549-3 assume !lis_#t~short11; 38226#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38222#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38220#L548-4 assume true; 38218#L548-1 assume !(lis_~j~0 < lis_~i~0); 38216#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 38214#L547-4 assume true; 38211#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38209#L548-4 assume true; 38207#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38205#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38203#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38200#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38195#L549-3 assume !lis_#t~short11; 38182#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38179#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38177#L548-4 assume true; 38175#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38174#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38172#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38169#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38164#L549-3 assume !lis_#t~short11; 38151#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38148#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38146#L548-4 assume true; 38144#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38142#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38140#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38137#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38133#L549-3 assume !lis_#t~short11; 38121#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38117#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38114#L548-4 assume true; 38112#L548-1 assume !(lis_~j~0 < lis_~i~0); 38110#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 38108#L547-4 assume true; 38105#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38103#L548-4 assume true; 38102#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38101#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38100#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38098#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38095#L549-3 assume !lis_#t~short11; 38089#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38088#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38087#L548-4 assume true; 38086#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38085#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38084#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38082#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38079#L549-3 assume !lis_#t~short11; 38073#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38072#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38071#L548-4 assume true; 38070#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38069#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38068#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38066#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38063#L549-3 assume !lis_#t~short11; 38057#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38056#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38055#L548-4 assume true; 38040#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38054#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38053#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38051#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38048#L549-3 assume !lis_#t~short11; 38042#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38041#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38039#L548-4 assume true; 38038#L548-1 assume !(lis_~j~0 < lis_~i~0); 38037#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 38036#L547-4 assume true; 38035#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38034#L548-4 assume true; 38033#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38032#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38031#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38029#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38026#L549-3 assume !lis_#t~short11; 38020#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38019#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38018#L548-4 assume true; 38017#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38016#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 38015#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 38013#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 38010#L549-3 assume !lis_#t~short11; 38004#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 38003#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 38002#L548-4 assume true; 38001#L548-1 assume !!(lis_~j~0 < lis_~i~0); 38000#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37999#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37997#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37994#L549-3 assume !lis_#t~short11; 37988#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37987#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37986#L548-4 assume true; 37985#L548-1 assume !!(lis_~j~0 < lis_~i~0); 37984#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37983#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37981#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37978#L549-3 assume !lis_#t~short11; 37972#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37971#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37970#L548-4 assume true; 37955#L548-1 assume !!(lis_~j~0 < lis_~i~0); 37969#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37968#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37966#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37963#L549-3 assume !lis_#t~short11; 37957#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37956#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37954#L548-4 assume true; 37953#L548-1 assume !(lis_~j~0 < lis_~i~0); 37952#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 37951#L547-4 assume true; 37950#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 37949#L548-4 assume true; 37948#L548-1 assume !!(lis_~j~0 < lis_~i~0); 37947#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37946#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37944#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37941#L549-3 assume !lis_#t~short11; 37935#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37934#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37933#L548-4 assume true; 37932#L548-1 assume !!(lis_~j~0 < lis_~i~0); 37931#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37930#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37928#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37925#L549-3 assume !lis_#t~short11; 37915#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37912#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37908#L548-4 assume true; 37906#L548-1 assume !!(lis_~j~0 < lis_~i~0); 37904#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37902#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37899#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37894#L549-3 assume !lis_#t~short11; 37883#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37880#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37876#L548-4 assume true; 37874#L548-1 assume !!(lis_~j~0 < lis_~i~0); 37872#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37870#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37867#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37862#L549-3 assume !lis_#t~short11; 37851#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37848#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37844#L548-4 assume true; 37809#L548-1 assume !!(lis_~j~0 < lis_~i~0); 37808#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37807#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37805#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37800#L549-3 assume !lis_#t~short11; 37802#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37789#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37790#L548-4 assume true; 37786#L548-1 assume !(lis_~j~0 < lis_~i~0); 37785#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 37783#L547-4 assume true; 37782#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 37709#L548-4 [2018-11-10 03:56:53,289 INFO L795 eck$LassoCheckResult]: Loop: 37709#L548-4 assume true; 37700#L548-1 assume !!(lis_~j~0 < lis_~i~0); 37701#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 37728#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 37729#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 37733#L549-3 assume !lis_#t~short11; 37722#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 37704#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 37709#L548-4 [2018-11-10 03:56:53,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477327, now seen corresponding path program 26 times [2018-11-10 03:56:53,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:53,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:53,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:53,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:56:53,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 943 proven. 378 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2018-11-10 03:56:53,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:56:53,506 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:56:53,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:56:53,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:56:53,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:56:53,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 1567 proven. 90 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-11-10 03:56:53,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:56:53,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-11-10 03:56:53,712 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:56:53,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 14 times [2018-11-10 03:56:53,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:53,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:53,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:56:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:53,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 03:56:53,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-11-10 03:56:53,755 INFO L87 Difference]: Start difference. First operand 634 states and 714 transitions. cyclomatic complexity: 88 Second operand 29 states. [2018-11-10 03:56:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:56:54,690 INFO L93 Difference]: Finished difference Result 1302 states and 1468 transitions. [2018-11-10 03:56:54,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 03:56:54,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1302 states and 1468 transitions. [2018-11-10 03:56:54,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:56:54,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1302 states to 1298 states and 1464 transitions. [2018-11-10 03:56:54,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2018-11-10 03:56:54,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-10 03:56:54,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1298 states and 1464 transitions. [2018-11-10 03:56:54,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:56:54,694 INFO L705 BuchiCegarLoop]: Abstraction has 1298 states and 1464 transitions. [2018-11-10 03:56:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states and 1464 transitions. [2018-11-10 03:56:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 872. [2018-11-10 03:56:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-10 03:56:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 983 transitions. [2018-11-10 03:56:54,703 INFO L728 BuchiCegarLoop]: Abstraction has 872 states and 983 transitions. [2018-11-10 03:56:54,703 INFO L608 BuchiCegarLoop]: Abstraction has 872 states and 983 transitions. [2018-11-10 03:56:54,703 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-10 03:56:54,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 872 states and 983 transitions. [2018-11-10 03:56:54,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:56:54,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:56:54,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:56:54,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [27, 21, 21, 21, 21, 21, 21, 21, 8, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-11-10 03:56:54,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:56:54,706 INFO L793 eck$LassoCheckResult]: Stem: 40480#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 40444#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40461#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 40445#L545-3 assume true; 40446#L545-1 assume !!(lis_~i~0 < lis_~N); 40435#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 40436#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 40437#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 40447#L545-3 assume true; 40448#L545-1 assume !!(lis_~i~0 < lis_~N); 40511#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 40509#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 40441#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 40442#L545-3 assume true; 40505#L545-1 assume !!(lis_~i~0 < lis_~N); 40504#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 40503#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 40502#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 40501#L545-3 assume true; 40500#L545-1 assume !!(lis_~i~0 < lis_~N); 40499#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 40498#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 40497#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 40496#L545-3 assume true; 40495#L545-1 assume !!(lis_~i~0 < lis_~N); 40494#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 40493#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 40492#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 40491#L545-3 assume true; 40490#L545-1 assume !!(lis_~i~0 < lis_~N); 40489#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 40488#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 40487#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 40486#L545-3 assume true; 40482#L545-1 assume !!(lis_~i~0 < lis_~N); 40485#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 40484#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 40483#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 40481#L545-3 assume true; 40470#L545-1 assume !(lis_~i~0 < lis_~N); 40449#L545-4 lis_~i~0 := 1; 40450#L547-4 assume true; 40475#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40996#L548-4 assume true; 40995#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40994#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40993#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40991#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40988#L549-3 assume !lis_#t~short11; 40982#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40981#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40980#L548-4 assume true; 40979#L548-1 assume !(lis_~j~0 < lis_~i~0); 40978#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 40977#L547-4 assume true; 40976#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40975#L548-4 assume true; 40974#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40973#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40972#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40970#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40967#L549-3 assume !lis_#t~short11; 40961#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40960#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40959#L548-4 assume true; 40958#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40957#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40956#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40954#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40951#L549-3 assume !lis_#t~short11; 40945#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40944#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40942#L548-4 assume true; 40941#L548-1 assume !(lis_~j~0 < lis_~i~0); 40940#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 40939#L547-4 assume true; 40938#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40937#L548-4 assume true; 40936#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40935#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40934#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40932#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40929#L549-3 assume !lis_#t~short11; 40923#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40922#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40921#L548-4 assume true; 40920#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40919#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40918#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40916#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40913#L549-3 assume !lis_#t~short11; 40907#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40906#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40905#L548-4 assume true; 40904#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40903#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40902#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40900#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40897#L549-3 assume !lis_#t~short11; 40891#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40890#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40888#L548-4 assume true; 40887#L548-1 assume !(lis_~j~0 < lis_~i~0); 40886#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 40885#L547-4 assume true; 40884#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40883#L548-4 assume true; 40882#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40881#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40880#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40878#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40875#L549-3 assume !lis_#t~short11; 40868#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40867#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40866#L548-4 assume true; 40865#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40864#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40863#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40861#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40858#L549-3 assume !lis_#t~short11; 40851#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40850#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40849#L548-4 assume true; 40848#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40847#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40846#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40844#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40841#L549-3 assume !lis_#t~short11; 40834#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40833#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40832#L548-4 assume true; 40831#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40829#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40827#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40824#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40820#L549-3 assume !lis_#t~short11; 40806#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40804#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40801#L548-4 assume true; 40799#L548-1 assume !(lis_~j~0 < lis_~i~0); 40797#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 40794#L547-4 assume true; 40792#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40791#L548-4 assume true; 40790#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40789#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40788#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40786#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40783#L549-3 assume !lis_#t~short11; 40777#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40776#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40775#L548-4 assume true; 40774#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40773#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40772#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40770#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40767#L549-3 assume !lis_#t~short11; 40761#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40760#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40759#L548-4 assume true; 40758#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40757#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40756#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40754#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40751#L549-3 assume !lis_#t~short11; 40745#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40744#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40743#L548-4 assume true; 40742#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40741#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40740#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40738#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40735#L549-3 assume !lis_#t~short11; 40729#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40728#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40727#L548-4 assume true; 40712#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40726#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40725#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40723#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40720#L549-3 assume !lis_#t~short11; 40714#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40713#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40711#L548-4 assume true; 40710#L548-1 assume !(lis_~j~0 < lis_~i~0); 40709#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 40708#L547-4 assume true; 40707#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40706#L548-4 assume true; 40705#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40704#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40703#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40701#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40698#L549-3 assume !lis_#t~short11; 40692#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40691#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40690#L548-4 assume true; 40689#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40688#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40687#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40685#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40682#L549-3 assume !lis_#t~short11; 40676#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40675#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40674#L548-4 assume true; 40673#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40672#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40671#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40669#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40666#L549-3 assume !lis_#t~short11; 40660#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40659#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40658#L548-4 assume true; 40657#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40656#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40655#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40653#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40650#L549-3 assume !lis_#t~short11; 40644#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40643#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40642#L548-4 assume true; 40641#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40640#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40639#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40637#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40634#L549-3 assume !lis_#t~short11; 40627#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40626#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40625#L548-4 assume true; 40534#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40533#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40532#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40530#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40525#L549-3 assume !lis_#t~short11; 40527#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40514#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40515#L548-4 assume true; 40510#L548-1 assume !(lis_~j~0 < lis_~i~0); 40508#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 40506#L547-4 assume true; 40464#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40438#L548-4 [2018-11-10 03:56:54,706 INFO L795 eck$LassoCheckResult]: Loop: 40438#L548-4 assume true; 40429#L548-1 assume !!(lis_~j~0 < lis_~i~0); 40430#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 40457#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 40458#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 40462#L549-3 assume !lis_#t~short11; 40451#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 40433#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 40438#L548-4 [2018-11-10 03:56:54,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2037081375, now seen corresponding path program 27 times [2018-11-10 03:56:54,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:54,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:54,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:56:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2138 backedges. 72 proven. 946 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2018-11-10 03:56:54,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:56:54,958 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_379b46da-d58e-4ff0-a450-70338c213edd/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:56:54,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:56:55,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 03:56:55,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:56:55,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2138 backedges. 927 proven. 161 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2018-11-10 03:56:55,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:56:55,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2018-11-10 03:56:55,393 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:56:55,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 15 times [2018-11-10 03:56:55,393 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:55,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:55,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:56:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 03:56:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 03:56:55,447 INFO L87 Difference]: Start difference. First operand 872 states and 983 transitions. cyclomatic complexity: 119 Second operand 37 states. [2018-11-10 03:56:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:56:56,346 INFO L93 Difference]: Finished difference Result 1376 states and 1546 transitions. [2018-11-10 03:56:56,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-10 03:56:56,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1376 states and 1546 transitions. [2018-11-10 03:56:56,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 03:56:56,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1376 states to 1000 states and 1127 transitions. [2018-11-10 03:56:56,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 03:56:56,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 03:56:56,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1000 states and 1127 transitions. [2018-11-10 03:56:56,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:56:56,351 INFO L705 BuchiCegarLoop]: Abstraction has 1000 states and 1127 transitions. [2018-11-10 03:56:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states and 1127 transitions. [2018-11-10 03:56:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 877. [2018-11-10 03:56:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-11-10 03:56:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 988 transitions. [2018-11-10 03:56:56,356 INFO L728 BuchiCegarLoop]: Abstraction has 877 states and 988 transitions. [2018-11-10 03:56:56,356 INFO L608 BuchiCegarLoop]: Abstraction has 877 states and 988 transitions. [2018-11-10 03:56:56,356 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-10 03:56:56,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 877 states and 988 transitions. [2018-11-10 03:56:56,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:56:56,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:56:56,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:56:56,359 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [27, 21, 21, 21, 21, 21, 21, 21, 9, 8, 8, 8, 8, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-11-10 03:56:56,359 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:56:56,359 INFO L793 eck$LassoCheckResult]: Stem: 43553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 43515#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 43516#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 43532#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4 * lis_~N;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 43517#L545-3 assume true; 43518#L545-1 assume !!(lis_~i~0 < lis_~N); 43507#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 43508#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 43512#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 43514#L545-3 assume true; 43519#L545-1 assume !!(lis_~i~0 < lis_~N); 43590#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 43589#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 43588#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 43587#L545-3 assume true; 43586#L545-1 assume !!(lis_~i~0 < lis_~N); 43585#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 43584#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 43583#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 43582#L545-3 assume true; 43581#L545-1 assume !!(lis_~i~0 < lis_~N); 43580#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 43579#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 43578#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 43577#L545-3 assume true; 43576#L545-1 assume !!(lis_~i~0 < lis_~N); 43575#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 43574#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 43573#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 43572#L545-3 assume true; 43571#L545-1 assume !!(lis_~i~0 < lis_~N); 43570#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 43569#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 43568#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 43567#L545-3 assume true; 43566#L545-1 assume !!(lis_~i~0 < lis_~N); 43565#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 43564#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 43563#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 43562#L545-3 assume true; 43555#L545-1 assume !!(lis_~i~0 < lis_~N); 43559#L546 SUMMARY for call write~int(1, lis_~best~0.base, lis_~best~0.offset + lis_~i~0 * 4, 4); srcloc: L546 43557#L546-1 SUMMARY for call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + lis_~i~0 * 4, 4); srcloc: L546-1 43556#L546-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := lis_#t~post4 + 1;havoc lis_#t~post4; 43554#L545-3 assume true; 43548#L545-1 assume !(lis_~i~0 < lis_~N); 43522#L545-4 lis_~i~0 := 1; 43523#L547-4 assume true; 43538#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43539#L548-4 assume true; 44128#L548-1 assume !!(lis_~j~0 < lis_~i~0); 44127#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 44126#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 44124#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 44121#L549-3 assume !lis_#t~short11; 44113#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 44112#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 44111#L548-4 assume true; 44110#L548-1 assume !(lis_~j~0 < lis_~i~0); 44109#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 44108#L547-4 assume true; 44107#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 44106#L548-4 assume true; 44105#L548-1 assume !!(lis_~j~0 < lis_~i~0); 44104#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 44103#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 44101#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 44098#L549-3 assume !lis_#t~short11; 44090#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 44089#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 44088#L548-4 assume true; 44087#L548-1 assume !!(lis_~j~0 < lis_~i~0); 44086#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 44085#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 44083#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 44080#L549-3 assume !lis_#t~short11; 44073#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 44072#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 44070#L548-4 assume true; 44069#L548-1 assume !(lis_~j~0 < lis_~i~0); 44068#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 44067#L547-4 assume true; 44066#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 44065#L548-4 assume true; 44064#L548-1 assume !!(lis_~j~0 < lis_~i~0); 44063#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 44062#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 44061#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 44060#L549-3 assume !lis_#t~short11; 44044#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 44042#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 44040#L548-4 assume true; 44038#L548-1 assume !!(lis_~j~0 < lis_~i~0); 44036#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 44034#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 44031#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 44029#L549-3 assume !lis_#t~short11; 44011#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 44009#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 44007#L548-4 assume true; 44005#L548-1 assume !!(lis_~j~0 < lis_~i~0); 44003#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 44001#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43999#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43997#L549-3 assume !lis_#t~short11; 43978#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43976#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43973#L548-4 assume true; 43971#L548-1 assume !(lis_~j~0 < lis_~i~0); 43969#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 43967#L547-4 assume true; 43965#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43963#L548-4 assume true; 43961#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43959#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43957#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43954#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43952#L549-3 assume !lis_#t~short11; 43933#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43932#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43930#L548-4 assume true; 43926#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43922#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43892#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43889#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43887#L549-3 assume !lis_#t~short11; 43867#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43865#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43863#L548-4 assume true; 43862#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43860#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43858#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43856#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43854#L549-3 assume !lis_#t~short11; 43836#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43834#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43832#L548-4 assume true; 43830#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43828#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43826#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43824#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43822#L549-3 assume !lis_#t~short11; 43805#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43803#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43800#L548-4 assume true; 43798#L548-1 assume !(lis_~j~0 < lis_~i~0); 43796#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 43793#L547-4 assume true; 43791#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43790#L548-4 assume true; 43789#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43788#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43787#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43786#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43785#L549-3 assume !lis_#t~short11; 43776#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43775#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43774#L548-4 assume true; 43773#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43772#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43771#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43770#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43769#L549-3 assume !lis_#t~short11; 43760#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43759#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43758#L548-4 assume true; 43757#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43756#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43755#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43754#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43753#L549-3 assume !lis_#t~short11; 43744#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43743#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43742#L548-4 assume true; 43741#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43740#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43739#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43738#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43737#L549-3 assume !lis_#t~short11; 43728#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43727#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43726#L548-4 assume true; 43711#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43725#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43724#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43723#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43722#L549-3 assume !lis_#t~short11; 43713#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43712#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43710#L548-4 assume true; 43709#L548-1 assume !(lis_~j~0 < lis_~i~0); 43708#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 43707#L547-4 assume true; 43706#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43705#L548-4 assume true; 43704#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43703#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43702#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43701#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43700#L549-3 assume !lis_#t~short11; 43691#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43690#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43689#L548-4 assume true; 43688#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43687#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43686#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43685#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43684#L549-3 assume !lis_#t~short11; 43675#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43674#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43673#L548-4 assume true; 43672#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43671#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43670#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43669#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43668#L549-3 assume !lis_#t~short11; 43659#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43658#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43657#L548-4 assume true; 43656#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43655#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43654#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43653#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43652#L549-3 assume !lis_#t~short11; 43643#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43642#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43641#L548-4 assume true; 43640#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43639#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43638#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43637#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43636#L549-3 assume !lis_#t~short11; 43627#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43626#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43625#L548-4 assume true; 43610#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43623#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43622#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43621#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43617#L549-3 assume !lis_#t~short11; 43614#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43611#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43609#L548-4 assume true; 43591#L548-1 assume !(lis_~j~0 < lis_~i~0); 43561#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := lis_#t~post5 + 1;havoc lis_#t~post5; 43560#L547-4 assume true; 43558#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43509#L548-4 [2018-11-10 03:56:56,360 INFO L795 eck$LassoCheckResult]: Loop: 43509#L548-4 assume true; 43503#L548-1 assume !!(lis_~j~0 < lis_~i~0); 43504#L549 SUMMARY for call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + lis_~i~0 * 4, 4); srcloc: L549 43528#L549-1 SUMMARY for call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + lis_~j~0 * 4, 4); srcloc: L549-1 43529#L549-2 lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43533#L549-3 assume !lis_#t~short11; 43520#L549-8 assume !lis_#t~short11;havoc lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem8;havoc lis_#t~mem7;havoc lis_#t~mem10; 43500#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := lis_#t~post6 + 1;havoc lis_#t~post6; 43509#L548-4 [2018-11-10 03:56:56,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash 9443783, now seen corresponding path program 28 times [2018-11-10 03:56:56,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:56,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:56:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:56,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash -829622959, now seen corresponding path program 16 times [2018-11-10 03:56:56,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:56,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:56,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:56:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:56,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1696470761, now seen corresponding path program 29 times [2018-11-10 03:56:56,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:56,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:56,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:56,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:56:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:50,931 WARN L179 SmtUtils]: Spent 1.91 m on a formula simplification. DAG size of input: 817 DAG size of output: 540 [2018-11-10 03:58:54,409 WARN L179 SmtUtils]: Spent 3.46 s on a formula simplification that was a NOOP. DAG size: 218 [2018-11-10 03:58:54,412 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:58:54,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:58:54,412 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:58:54,412 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:58:54,412 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:58:54,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:54,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:58:54,412 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:58:54,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration32_Lasso [2018-11-10 03:58:54,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:58:54,413 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:58:54,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:54,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:54,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:54,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:54,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:54,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,501 WARN L179 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 176 [2018-11-10 03:59:10,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:59:10,778 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-11-10 03:59:11,094 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:59:11,094 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:59:11,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:59:11,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:59:11,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:59:11,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:59:11,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:59:11,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:59:11,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:59:11,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:59:11,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:59:11,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:59:11,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:59:11,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:59:11,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:59:11,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:59:11,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:59:11,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:59:11,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:59:11,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:59:11,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:59:11,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:59:11,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:59:11,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:59:11,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:59:11,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:59:11,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:59:11,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:59:11,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:59:11,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:59:11,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:59:11,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:59:11,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:59:11,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:59:11,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:59:11,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:59:11,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:59:11,118 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:59:11,133 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:59:11,134 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 03:59:11,134 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:59:11,134 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:59:11,134 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:59:11,134 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -1*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-10 03:59:12,739 INFO L297 tatePredicateManager]: 316 out of 316 supporting invariants were superfluous and have been removed [2018-11-10 03:59:12,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:12,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:12,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:12,800 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:59:12,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 877 states and 988 transitions. cyclomatic complexity: 119 Second operand 4 states. [2018-11-10 03:59:12,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 877 states and 988 transitions. cyclomatic complexity: 119. Second operand 4 states. Result 894 states and 1007 transitions. Complement of second has 7 states. [2018-11-10 03:59:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:59:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:59:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-10 03:59:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 247 letters. Loop has 8 letters. [2018-11-10 03:59:12,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:59:12,822 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:59:12,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:12,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:12,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:12,905 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:59:12,905 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 877 states and 988 transitions. cyclomatic complexity: 119 Second operand 4 states. [2018-11-10 03:59:12,921 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 877 states and 988 transitions. cyclomatic complexity: 119. Second operand 4 states. Result 894 states and 1007 transitions. Complement of second has 7 states. [2018-11-10 03:59:12,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:59:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:59:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-10 03:59:12,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 247 letters. Loop has 8 letters. [2018-11-10 03:59:12,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:59:12,922 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:59:12,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:13,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:13,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:13,034 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 2 loop predicates [2018-11-10 03:59:13,034 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 877 states and 988 transitions. cyclomatic complexity: 119 Second operand 4 states. [2018-11-10 03:59:13,054 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 877 states and 988 transitions. cyclomatic complexity: 119. Second operand 4 states. Result 1623 states and 1841 transitions. Complement of second has 6 states. [2018-11-10 03:59:13,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:59:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:59:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-10 03:59:13,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 247 letters. Loop has 8 letters. [2018-11-10 03:59:13,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:59:13,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 255 letters. Loop has 8 letters. [2018-11-10 03:59:13,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:59:13,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 247 letters. Loop has 16 letters. [2018-11-10 03:59:13,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:59:13,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1623 states and 1841 transitions. [2018-11-10 03:59:13,062 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:59:13,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1623 states to 0 states and 0 transitions. [2018-11-10 03:59:13,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:59:13,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:59:13,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:59:13,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:59:13,063 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:59:13,063 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:59:13,063 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:59:13,063 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-10 03:59:13,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:59:13,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:59:13,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:59:13,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:59:13 BoogieIcfgContainer [2018-11-10 03:59:13,069 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:59:13,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:59:13,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:59:13,070 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:59:13,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:54:07" (3/4) ... [2018-11-10 03:59:13,073 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:59:13,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:59:13,075 INFO L168 Benchmark]: Toolchain (without parser) took 306239.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.9 MB). Free memory was 955.5 MB in the beginning and 1.3 GB in the end (delta: -316.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:13,075 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:59:13,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.07 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 934.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:13,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:13,076 INFO L168 Benchmark]: Boogie Preprocessor took 26.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:13,076 INFO L168 Benchmark]: RCFGBuilder took 326.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:13,076 INFO L168 Benchmark]: BuchiAutomizer took 305496.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.0 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:13,077 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:59:13,083 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.07 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 934.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 326.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 305496.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.0 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 33 terminating modules (22 trivial, 5 deterministic, 6 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 7 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[a] and consists of 7 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One nondeterministic module has affine ranking function -4 * j + 3 * i and consists of 8 locations. One nondeterministic module has affine ranking function -6 * j + 5 * i and consists of 9 locations. One nondeterministic module has affine ranking function -2 * j + 7 and consists of 10 locations. One nondeterministic module has affine ranking function -10 * j + 9 * i and consists of 11 locations. One nondeterministic module has affine ranking function -2 * j + 11 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * j + i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 44 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 305.4s and 33 iterations. TraceHistogramMax:27. Analysis of lassos took 287.4s. Construction of modules took 6.7s. Büchi inclusion checks took 10.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 32. Automata minimization 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 2640 StatesRemovedByMinimization, 29 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 877 states and ocurred in iteration 31. Nontrivial modules had stage [5, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/14 HoareTripleCheckerStatistics: 2112 SDtfs, 11251 SDslu, 10319 SDs, 0 SdLazy, 14274 SolverSat, 1278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU15 SILI1 SILT1 lasso10 LassoPreprocessingBenchmarks: Lassos: inital63605 mio100 ax100 hnf98 lsp98 ukn38 mio100 lsp62 div100 bol100 ite100 ukn100 eq190 hnf84 smp95 dnf100 smp100 tf101 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...