./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/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 64bit --witnessprinter.graph.data.programhash 10c50c605d9fb7cd886e3d668ba568a2b619230b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:27:43,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:27:43,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:27:43,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:27:43,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:27:43,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:27:43,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:27:43,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:27:43,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:27:43,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:27:43,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:27:43,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:27:43,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:27:43,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:27:43,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:27:43,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:27:43,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:27:43,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:27:43,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:27:43,366 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:27:43,367 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:27:43,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:27:43,369 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:27:43,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:27:43,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:27:43,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:27:43,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:27:43,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:27:43,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:27:43,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:27:43,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:27:43,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:27:43,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:27:43,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:27:43,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:27:43,375 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:27:43,376 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:27:43,386 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:27:43,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:27:43,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:27:43,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:27:43,388 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:27:43,388 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:27:43,388 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:27:43,388 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:27:43,388 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:27:43,388 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:27:43,389 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:27:43,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:27:43,389 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:27:43,389 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:27:43,389 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:27:43,389 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:27:43,389 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:27:43,389 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:27:43,390 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:27:43,390 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:27:43,390 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:27:43,390 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:27:43,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:27:43,390 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:27:43,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:27:43,391 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:27:43,391 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:27:43,391 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:27:43,392 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_60075a96-6629-4ebd-8c7c-566324f23b55/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10c50c605d9fb7cd886e3d668ba568a2b619230b [2018-11-10 05:27:43,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:27:43,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:27:43,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:27:43,429 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:27:43,429 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:27:43,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2018-11-10 05:27:43,471 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/data/25b33181f/1fcf75084ede43859651caf91e097abf/FLAG16b532197 [2018-11-10 05:27:43,809 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:27:43,809 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/sv-benchmarks/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2018-11-10 05:27:43,817 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/data/25b33181f/1fcf75084ede43859651caf91e097abf/FLAG16b532197 [2018-11-10 05:27:43,829 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/bin-2019/uautomizer/data/25b33181f/1fcf75084ede43859651caf91e097abf [2018-11-10 05:27:43,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:27:43,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:27:43,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:27:43,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:27:43,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:27:43,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:43" (1/1) ... [2018-11-10 05:27:43,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:43, skipping insertion in model container [2018-11-10 05:27:43,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:43" (1/1) ... [2018-11-10 05:27:43,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:27:43,870 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:27:44,046 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:27:44,054 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:27:44,083 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:27:44,112 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:27:44,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44 WrapperNode [2018-11-10 05:27:44,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:27:44,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:27:44,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:27:44,113 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:27:44,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:27:44,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:27:44,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:27:44,179 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:27:44,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... [2018-11-10 05:27:44,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:27:44,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:27:44,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:27:44,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:27:44,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60075a96-6629-4ebd-8c7c-566324f23b55/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 05:27:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:27:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:27:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:27:44,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:27:44,358 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:27:44,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:44 BoogieIcfgContainer [2018-11-10 05:27:44,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:27:44,359 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:27:44,359 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:27:44,362 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:27:44,362 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:27:44,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:27:43" (1/3) ... [2018-11-10 05:27:44,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a48dc47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:27:44, skipping insertion in model container [2018-11-10 05:27:44,363 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:27:44,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:44" (2/3) ... [2018-11-10 05:27:44,364 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a48dc47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:27:44, skipping insertion in model container [2018-11-10 05:27:44,364 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:27:44,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:44" (3/3) ... [2018-11-10 05:27:44,365 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-termination.c.i [2018-11-10 05:27:44,402 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:27:44,402 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:27:44,402 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:27:44,402 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:27:44,403 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:27:44,403 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:27:44,403 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:27:44,403 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:27:44,403 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:27:44,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-10 05:27:44,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:27:44,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:44,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:44,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:27:44,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:27:44,434 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:27:44,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-10 05:27:44,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:27:44,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:44,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:44,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:27:44,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:27:44,443 INFO L793 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 15#L561true assume !(main_~array_size~0 < 1); 20#L561-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 5#L551-4true [2018-11-10 05:27:44,443 INFO L795 eck$LassoCheckResult]: Loop: 5#L551-4true assume true; 16#L551-1true assume !!(test_fun_~i~0 < test_fun_~N); 3#L552-4true assume !true; 4#L551-3true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 5#L551-4true [2018-11-10 05:27:44,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 05:27:44,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:44,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:44,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:44,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:44,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1329224, now seen corresponding path program 1 times [2018-11-10 05:27:44,523 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:44,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:44,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:44,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:44,546 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 05:27:44,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:44,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:27:44,551 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:27:44,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 05:27:44,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:27:44,565 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-10 05:27:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:44,569 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-10 05:27:44,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:27:44,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-10 05:27:44,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:27:44,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2018-11-10 05:27:44,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 05:27:44,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 05:27:44,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-10 05:27:44,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:27:44,576 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 05:27:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-10 05:27:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-10 05:27:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 05:27:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-10 05:27:44,594 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 05:27:44,594 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 05:27:44,594 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:27:44,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-10 05:27:44,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:27:44,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:44,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:44,595 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:27:44,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:27:44,596 INFO L793 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 52#L561 assume !(main_~array_size~0 < 1); 59#L561-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 49#L551-4 [2018-11-10 05:27:44,596 INFO L795 eck$LassoCheckResult]: Loop: 49#L551-4 assume true; 50#L551-1 assume !!(test_fun_~i~0 < test_fun_~N); 46#L552-4 assume true; 47#L552-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552-1 57#L552-2 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 48#L551-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 49#L551-4 [2018-11-10 05:27:44,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 05:27:44,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:44,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:44,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1276985362, now seen corresponding path program 1 times [2018-11-10 05:27:44,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:44,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:44,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:44,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2015042314, now seen corresponding path program 1 times [2018-11-10 05:27:44,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:44,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:44,822 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:27:44,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:27:44,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:27:44,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:27:44,823 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:27:44,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:44,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:27:44,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:27:44,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 05:27:44,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:27:44,824 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:27:44,841 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 05:27:44,844 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 05:27:44,847 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 05:27:44,849 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 05:27:44,852 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 05:27:44,854 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 05:27:44,858 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 05:27:44,861 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 05:27:44,863 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 05:27:44,865 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 05:27:44,991 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 05:27:44,997 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 05:27:45,005 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 05:27:45,009 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 05:27:45,011 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 05:27:45,013 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 05:27:45,273 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:27:45,276 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:27:45,278 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 05:27:45,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:45,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:45,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:45,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,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 05:27:45,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:45,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:45,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:45,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,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 05:27:45,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:45,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:45,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:45,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,291 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 05:27:45,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:45,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:45,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,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 05:27:45,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:45,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:45,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:45,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,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 05:27:45,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:45,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:45,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,309 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 05:27:45,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:45,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:45,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,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 05:27:45,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:45,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:45,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:45,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,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 05:27:45,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:45,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:45,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:45,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:45,321 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 05:27:45,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:45,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:45,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:45,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:45,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:45,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:45,372 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:27:45,406 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 05:27:45,406 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 05:27:45,408 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:27:45,409 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:27:45,409 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:27:45,410 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-10 05:27:45,422 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 05:27:45,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:27:45,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:45,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:45,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:45,491 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 05:27:45,493 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 05:27:45,494 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 05:27:45,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 28 states and 32 transitions. Complement of second has 6 states. [2018-11-10 05:27:45,523 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 05:27:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:27:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 05:27:45,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 05:27:45,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:45,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 05:27:45,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:45,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-10 05:27:45,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:45,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-11-10 05:27:45,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:27:45,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 31 transitions. [2018-11-10 05:27:45,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 05:27:45,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 05:27:45,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-10 05:27:45,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:27:45,529 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-10 05:27:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-10 05:27:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-10 05:27:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 05:27:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 05:27:45,531 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 05:27:45,531 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 05:27:45,531 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:27:45,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 05:27:45,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:27:45,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:45,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:45,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:27:45,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:45,532 INFO L793 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 163#L561 assume !(main_~array_size~0 < 1); 175#L561-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 159#L551-4 assume true; 161#L551-1 assume !!(test_fun_~i~0 < test_fun_~N); 153#L552-4 [2018-11-10 05:27:45,533 INFO L795 eck$LassoCheckResult]: Loop: 153#L552-4 assume true; 154#L552-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552-1 171#L552-2 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 164#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 165#L553-1 test_fun_#t~post5 := test_fun_#t~mem4; 169#L553-2 SUMMARY for call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-2 173#L553-3 havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 153#L552-4 [2018-11-10 05:27:45,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:45,533 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 05:27:45,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:45,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:45,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:45,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:45,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:45,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 1 times [2018-11-10 05:27:45,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:45,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:45,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:45,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:45,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:45,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash 633989139, now seen corresponding path program 1 times [2018-11-10 05:27:45,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:45,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:45,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:45,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:45,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:45,727 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:27:45,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:27:45,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:27:45,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:27:45,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:27:45,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:45,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:27:45,728 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:27:45,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 05:27:45,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:27:45,728 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:27:45,732 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 05:27:45,749 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 05:27:45,752 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 05:27:45,754 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 05:27:45,755 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 05:27:45,842 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 05:27:45,843 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 05:27:45,844 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 05:27:45,845 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 05:27:45,846 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 05:27:45,847 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 05:27:45,850 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 05:27:45,852 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 05:27:45,853 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 05:27:45,854 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 05:27:45,855 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 05:27:46,079 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:27:46,079 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:27:46,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 05:27:46,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:46,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:46,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:46,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,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 05:27:46,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,088 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 05:27:46,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:46,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:46,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:46,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,091 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 05:27:46,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,094 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 05:27:46,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,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 05:27:46,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,099 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:27:46,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,101 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:27:46,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,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 05:27:46,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,114 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 05:27:46,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,121 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 05:27:46,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,136 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 05:27:46,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,140 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 05:27:46,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:46,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:46,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:46,143 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:27:46,144 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:27:46,144 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:27:46,144 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:27:46,144 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:27:46,144 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:27:46,145 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-10 05:27:46,168 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 05:27:46,169 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:27:46,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:46,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:46,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:46,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:27:46,281 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 51 treesize of output 54 [2018-11-10 05:27:46,283 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-11-10 05:27:46,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:27:46,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:27:46,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:27:46,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 05:27:46,304 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 05:27:46,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:27:46,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-10 05:27:46,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 56 states and 63 transitions. Complement of second has 13 states. [2018-11-10 05:27:46,344 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 05:27:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:27:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 05:27:46,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-10 05:27:46,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:46,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 05:27:46,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:46,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-10 05:27:46,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:46,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2018-11-10 05:27:46,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:27:46,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 36 states and 41 transitions. [2018-11-10 05:27:46,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 05:27:46,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 05:27:46,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2018-11-10 05:27:46,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:27:46,347 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-10 05:27:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2018-11-10 05:27:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-10 05:27:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 05:27:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 05:27:46,348 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 05:27:46,348 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 05:27:46,348 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:27:46,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 05:27:46,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:27:46,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:46,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:46,350 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:46,350 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:46,350 INFO L793 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 331#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 332#L561 assume !(main_~array_size~0 < 1); 345#L561-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 327#L551-4 assume true; 328#L551-1 assume !!(test_fun_~i~0 < test_fun_~N); 349#L552-4 assume true; 326#L552-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552-1 350#L552-2 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 321#L551-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 322#L551-4 assume true; 330#L551-1 assume !!(test_fun_~i~0 < test_fun_~N); 323#L552-4 [2018-11-10 05:27:46,350 INFO L795 eck$LassoCheckResult]: Loop: 323#L552-4 assume true; 324#L552-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552-1 340#L552-2 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 333#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 334#L553-1 test_fun_#t~post5 := test_fun_#t~mem4; 338#L553-2 SUMMARY for call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-2 343#L553-3 havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 323#L552-4 [2018-11-10 05:27:46,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:46,351 INFO L82 PathProgramCache]: Analyzing trace with hash 574587163, now seen corresponding path program 2 times [2018-11-10 05:27:46,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:46,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:46,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:46,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:46,363 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 2 times [2018-11-10 05:27:46,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:46,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:46,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:46,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:46,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:46,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:46,370 INFO L82 PathProgramCache]: Analyzing trace with hash -878623198, now seen corresponding path program 1 times [2018-11-10 05:27:46,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:46,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:46,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:46,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:46,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:46,552 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:27:46,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:27:46,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:27:46,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:27:46,552 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:27:46,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:46,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:27:46,552 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:27:46,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 05:27:46,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:27:46,553 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:27:46,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 05:27:46,558 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 05:27:46,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 05:27:46,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 05:27:46,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 05:27:46,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 05:27:46,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 05:27:46,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 05:27:46,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 05:27:46,666 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 05:27:46,667 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 05:27:46,668 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 05:27:46,669 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 05:27:46,670 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 05:27:46,671 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 05:27:46,672 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 05:27:46,870 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:27:46,870 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:27:46,870 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 05:27:46,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:46,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:46,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:46,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,872 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 05:27:46,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:46,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:46,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:46,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,874 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 05:27:46,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,877 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 05:27:46,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,881 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 05:27:46,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,885 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 05:27:46,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:46,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:46,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:46,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,890 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 05:27:46,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:46,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:46,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:46,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,891 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 05:27:46,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,894 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 05:27:46,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,905 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 05:27:46,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,909 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 05:27:46,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,912 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 05:27:46,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,915 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 05:27:46,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,920 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 05:27:46,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:46,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:46,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:46,923 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 05:27:46,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:46,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:46,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:46,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:46,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:46,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:46,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:46,925 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:27:46,926 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:27:46,926 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:27:46,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:27:46,926 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:27:46,927 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:27:46,927 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-10 05:27:46,961 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 05:27:46,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:27:46,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:46,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:46,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:47,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:27:47,028 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 51 treesize of output 54 [2018-11-10 05:27:47,030 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:27:47,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 40 [2018-11-10 05:27:47,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 05:27:47,052 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 05:27:47,052 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:27:47,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 05:27:47,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 46 states and 53 transitions. Complement of second has 13 states. [2018-11-10 05:27:47,097 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 05:27:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:27:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 05:27:47,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 05:27:47,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:47,098 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:27:47,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:47,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:47,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:47,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:27:47,155 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 51 treesize of output 54 [2018-11-10 05:27:47,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:27:47,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 40 [2018-11-10 05:27:47,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 05:27:47,176 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 05:27:47,176 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:27:47,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 05:27:47,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 45 states and 52 transitions. Complement of second has 15 states. [2018-11-10 05:27:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 05:27:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:27:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-11-10 05:27:47,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 05:27:47,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:47,234 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:27:47,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:47,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:47,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:47,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:27:47,293 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 51 treesize of output 54 [2018-11-10 05:27:47,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:27:47,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 40 [2018-11-10 05:27:47,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:27:47,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 05:27:47,314 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 05:27:47,314 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 6 loop predicates [2018-11-10 05:27:47,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 05:27:47,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 60 states and 70 transitions. Complement of second has 12 states. [2018-11-10 05:27:47,396 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 05:27:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:27:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-11-10 05:27:47,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 05:27:47,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:47,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 19 letters. Loop has 7 letters. [2018-11-10 05:27:47,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:47,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 12 letters. Loop has 14 letters. [2018-11-10 05:27:47,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:47,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 70 transitions. [2018-11-10 05:27:47,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:27:47,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2018-11-10 05:27:47,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:27:47,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:27:47,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:27:47,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:27:47,401 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:27:47,401 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:27:47,401 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:27:47,401 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:27:47,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:27:47,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:27:47,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:27:47,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:27:47 BoogieIcfgContainer [2018-11-10 05:27:47,406 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:27:47,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:27:47,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:27:47,407 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:27:47,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:44" (3/4) ... [2018-11-10 05:27:47,412 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:27:47,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:27:47,412 INFO L168 Benchmark]: Toolchain (without parser) took 3580.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 955.5 MB in the beginning and 1.0 GB in the end (delta: -68.0 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:47,414 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:27:47,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.46 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 05:27:47,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:47,415 INFO L168 Benchmark]: Boogie Preprocessor took 14.11 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 05:27:47,415 INFO L168 Benchmark]: RCFGBuilder took 165.87 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:47,416 INFO L168 Benchmark]: BuchiAutomizer took 3046.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.0 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:47,416 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:27:47,419 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.46 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 65.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.11 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 165.87 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3046.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.0 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 78 SDtfs, 69 SDslu, 36 SDs, 0 SdLazy, 137 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax112 hnf99 lsp81 ukn93 mio100 lsp50 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...