./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.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_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/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 14310793a2daa3bf62d53b5cef67b6406903d242 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:38:31,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:38:31,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:38:31,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:38:31,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:38:31,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:38:31,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:38:31,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:38:31,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:38:31,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:38:31,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:38:31,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:38:31,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:38:31,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:38:31,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:38:31,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:38:31,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:38:31,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:38:31,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:38:31,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:38:31,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:38:31,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:38:31,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:38:31,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:38:31,598 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:38:31,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:38:31,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:38:31,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:38:31,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:38:31,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:38:31,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:38:31,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:38:31,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:38:31,604 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:38:31,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:38:31,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:38:31,606 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 04:38:31,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:38:31,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:38:31,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:38:31,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:38:31,620 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:38:31,620 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:38:31,620 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:38:31,620 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:38:31,620 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:38:31,621 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:38:31,621 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:38:31,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:38:31,621 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:38:31,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:38:31,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:38:31,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:38:31,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:38:31,622 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:38:31,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:38:31,622 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:38:31,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:38:31,623 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:38:31,623 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:38:31,623 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:38:31,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:38:31,625 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:38:31,626 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:38:31,627 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:38:31,627 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_b8f059f0-143d-4f74-854d-f35956a248cf/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 -> 14310793a2daa3bf62d53b5cef67b6406903d242 [2018-11-10 04:38:31,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:38:31,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:38:31,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:38:31,678 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:38:31,679 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:38:31,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:38:31,739 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/data/b60a1b342/766970889cc6407595be912c51b23f77/FLAG7c8c55516 [2018-11-10 04:38:32,139 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:38:32,139 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:38:32,148 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/data/b60a1b342/766970889cc6407595be912c51b23f77/FLAG7c8c55516 [2018-11-10 04:38:32,158 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/bin-2019/uautomizer/data/b60a1b342/766970889cc6407595be912c51b23f77 [2018-11-10 04:38:32,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:38:32,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:38:32,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:38:32,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:38:32,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:38:32,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5970c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32, skipping insertion in model container [2018-11-10 04:38:32,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:38:32,212 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:38:32,431 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:38:32,441 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:38:32,470 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:38:32,509 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:38:32,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32 WrapperNode [2018-11-10 04:38:32,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:38:32,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:38:32,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:38:32,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:38:32,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:38:32,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:38:32,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:38:32,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:38:32,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... [2018-11-10 04:38:32,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:38:32,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:38:32,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:38:32,627 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:38:32,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f059f0-143d-4f74-854d-f35956a248cf/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 04:38:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:38:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:38:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:38:32,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:38:32,956 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:38:32,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:38:32 BoogieIcfgContainer [2018-11-10 04:38:32,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:38:32,957 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:38:32,957 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:38:32,961 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:38:32,962 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:38:32,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:38:32" (1/3) ... [2018-11-10 04:38:32,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68e8fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:38:32, skipping insertion in model container [2018-11-10 04:38:32,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:38:32,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:38:32" (2/3) ... [2018-11-10 04:38:32,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68e8fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:38:32, skipping insertion in model container [2018-11-10 04:38:32,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:38:32,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:38:32" (3/3) ... [2018-11-10 04:38:32,966 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.14-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:38:33,026 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:38:33,027 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:38:33,027 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:38:33,027 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:38:33,027 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:38:33,027 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:38:33,028 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:38:33,028 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:38:33,028 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:38:33,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 04:38:33,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 04:38:33,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:38:33,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:38:33,076 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:38:33,076 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:38:33,076 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:38:33,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 04:38:33,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 04:38:33,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:38:33,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:38:33,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:38:33,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:38:33,088 INFO L793 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 11#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 13#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 26#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 14#L556-5true [2018-11-10 04:38:33,088 INFO L795 eck$LassoCheckResult]: Loop: 14#L556-5true assume true; 7#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9#L555-1true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 27#L555-2true test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 29#L555-3true assume !test_fun_#t~short8; 18#L555-7true assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 12#L556-4true assume !true; 14#L556-5true [2018-11-10 04:38:33,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 04:38:33,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:33,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:33,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:33,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1466819142, now seen corresponding path program 1 times [2018-11-10 04:38:33,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:33,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:33,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:33,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:33,286 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 04:38:33,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:38:33,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:38:33,291 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:38:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:38:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:38:33,306 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-11-10 04:38:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:38:33,332 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-10 04:38:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:38:33,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-11-10 04:38:33,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 04:38:33,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 25 states and 26 transitions. [2018-11-10 04:38:33,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 04:38:33,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 04:38:33,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-11-10 04:38:33,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:38:33,341 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 04:38:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-11-10 04:38:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 04:38:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 04:38:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 04:38:33,364 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 04:38:33,365 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 04:38:33,365 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:38:33,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2018-11-10 04:38:33,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 04:38:33,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:38:33,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:38:33,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:38:33,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:38:33,367 INFO L793 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 83#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 84#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 86#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 87#L556-5 [2018-11-10 04:38:33,367 INFO L795 eck$LassoCheckResult]: Loop: 87#L556-5 assume true; 79#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 80#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 81#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 93#L555-3 assume test_fun_#t~short8; 95#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 96#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 > 0; 89#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 74#L556-4 assume true; 85#L556-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 92#L556-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 87#L556-5 [2018-11-10 04:38:33,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 04:38:33,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:33,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:33,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1761102292, now seen corresponding path program 1 times [2018-11-10 04:38:33,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:33,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:38:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:33,561 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 04:38:33,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:38:33,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 04:38:33,562 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:38:33,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:38:33,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:38:33,563 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 10 states. [2018-11-10 04:38:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:38:33,747 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-10 04:38:33,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:38:33,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 31 transitions. [2018-11-10 04:38:33,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 04:38:33,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 31 transitions. [2018-11-10 04:38:33,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 04:38:33,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 04:38:33,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 31 transitions. [2018-11-10 04:38:33,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:38:33,752 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 04:38:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 31 transitions. [2018-11-10 04:38:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-10 04:38:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 04:38:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-10 04:38:33,756 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-10 04:38:33,756 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-10 04:38:33,756 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:38:33,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2018-11-10 04:38:33,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:38:33,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:38:33,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:38:33,758 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:38:33,758 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:38:33,758 INFO L793 eck$LassoCheckResult]: Stem: 175#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~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 163#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 166#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 167#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 168#L556-5 [2018-11-10 04:38:33,759 INFO L795 eck$LassoCheckResult]: Loop: 168#L556-5 assume true; 159#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 160#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 161#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 174#L555-3 assume test_fun_#t~short8; 176#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 177#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 > 0; 170#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 164#L556-4 assume true; 165#L556-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 173#L556-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 154#L557 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 155#L557-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 157#L557-2 havoc test_fun_#t~mem10; 158#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 171#L558-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 172#L558-2 havoc test_fun_#t~mem11; 169#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559 152#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-1 153#L559-2 havoc test_fun_#t~mem12; 156#L556-4 assume true; 179#L556-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 178#L556-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 168#L556-5 [2018-11-10 04:38:33,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 3 times [2018-11-10 04:38:33,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:33,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1816231821, now seen corresponding path program 1 times [2018-11-10 04:38:33,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:33,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:38:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:33,828 INFO L82 PathProgramCache]: Analyzing trace with hash 243723885, now seen corresponding path program 1 times [2018-11-10 04:38:33,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:33,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:33,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:33,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:34,093 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-10 04:38:34,456 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-10 04:38:34,563 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:38:34,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:38:34,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:38:34,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:38:34,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:38:34,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:38:34,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:38:34,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:38:34,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 04:38:34,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:38:34,565 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:38:34,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:34,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:34,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:34,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:34,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:34,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:34,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:34,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:34,971 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-11-10 04:38:35,129 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-11-10 04:38:35,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:35,684 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:38:35,688 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:38:35,689 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 04:38:35,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:35,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:35,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:35,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,696 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 04:38:35,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:35,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:35,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:38:35,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:35,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:35,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:35,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:38:35,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:35,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:35,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:35,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:38:35,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:35,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:35,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:35,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:38:35,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:35,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:35,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:35,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:38:35,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:35,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:35,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:35,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,722 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 04:38:35,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:35,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:35,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:38:35,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:35,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:35,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,748 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 04:38:35,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,749 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:38:35,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,752 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:38:35,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:35,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,760 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 04:38:35,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:35,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:35,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,766 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 04:38:35,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:35,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:35,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:35,777 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 04:38:35,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:35,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:35,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:35,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:35,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:35,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:35,805 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:38:35,823 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:38:35,823 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 04:38:35,826 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:38:35,828 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:38:35,829 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:38:35,829 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-10 04:38:35,908 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 04:38:35,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:38:35,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:35,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:38:35,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:35,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 04:38:35,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:35,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:36,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 04:38:36,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-10 04:38:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:36,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:38:36,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:36,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 04:38:36,137 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 34 treesize of output 25 [2018-11-10 04:38:36,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,151 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 04:38:36,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2018-11-10 04:38:36,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-10 04:38:36,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-10 04:38:36,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-10 04:38:36,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 04:38:36,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:38:36,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:38:36,248 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:38 [2018-11-10 04:38:36,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 04:38:36,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:38:36,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-10 04:38:36,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:38:36,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:38:36,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:64, output treesize:38 [2018-11-10 04:38:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:38:36,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 04:38:36,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 29 transitions. cyclomatic complexity: 2 Second operand 11 states. [2018-11-10 04:38:36,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 29 transitions. cyclomatic complexity: 2. Second operand 11 states. Result 58 states and 59 transitions. Complement of second has 14 states. [2018-11-10 04:38:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 04:38:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 04:38:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-10 04:38:36,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 5 letters. Loop has 23 letters. [2018-11-10 04:38:36,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:38:36,609 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:38:36,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:36,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:38:36,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:36,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 04:38:36,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:36,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:36,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 04:38:36,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-10 04:38:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:36,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:38:36,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:36,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 04:38:36,791 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 34 treesize of output 25 [2018-11-10 04:38:36,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,807 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 04:38:36,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2018-11-10 04:38:36,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-10 04:38:36,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-10 04:38:36,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-10 04:38:36,886 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 04:38:36,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:38:36,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:38:36,927 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:38 [2018-11-10 04:38:36,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-10 04:38:36,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:38:36,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:36,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 04:38:36,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:38:36,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:37,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:37,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:38:37,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:64, output treesize:38 [2018-11-10 04:38:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:38:37,060 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 04:38:37,060 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 29 transitions. cyclomatic complexity: 2 Second operand 11 states. [2018-11-10 04:38:37,327 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 29 transitions. cyclomatic complexity: 2. Second operand 11 states. Result 78 states and 81 transitions. Complement of second has 20 states. [2018-11-10 04:38:37,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 04:38:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 04:38:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2018-11-10 04:38:37,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 30 transitions. Stem has 5 letters. Loop has 23 letters. [2018-11-10 04:38:37,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:38:37,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 30 transitions. Stem has 28 letters. Loop has 23 letters. [2018-11-10 04:38:37,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:38:37,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 30 transitions. Stem has 5 letters. Loop has 46 letters. [2018-11-10 04:38:37,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:38:37,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 81 transitions. [2018-11-10 04:38:37,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:38:37,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 76 states and 79 transitions. [2018-11-10 04:38:37,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-10 04:38:37,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-10 04:38:37,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 79 transitions. [2018-11-10 04:38:37,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:38:37,335 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-10 04:38:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 79 transitions. [2018-11-10 04:38:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2018-11-10 04:38:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 04:38:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-11-10 04:38:37,340 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-11-10 04:38:37,340 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-11-10 04:38:37,340 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:38:37,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 74 transitions. [2018-11-10 04:38:37,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:38:37,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:38:37,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:38:37,343 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:38:37,343 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:38:37,344 INFO L793 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 691#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 695#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 699#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 717#L556-5 assume true; 698#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 687#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 688#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 719#L555-3 assume test_fun_#t~short8; 720#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 725#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 > 0; 726#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 736#L556-4 assume true; 735#L556-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 734#L556-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 733#L557 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 677#L557-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 678#L557-2 havoc test_fun_#t~mem10; 732#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 731#L558-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 730#L558-2 havoc test_fun_#t~mem11; 700#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559 701#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-1 670#L559-2 havoc test_fun_#t~mem12; 671#L556-4 [2018-11-10 04:38:37,344 INFO L795 eck$LassoCheckResult]: Loop: 671#L556-4 assume true; 692#L556-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 710#L556-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 673#L557 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 674#L557-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 680#L557-2 havoc test_fun_#t~mem10; 681#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 705#L558-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 707#L558-2 havoc test_fun_#t~mem11; 709#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559 666#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-1 667#L559-2 havoc test_fun_#t~mem12; 729#L556-4 assume true; 728#L556-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 727#L556-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 696#L556-5 assume true; 683#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 684#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 714#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 715#L555-3 assume test_fun_#t~short8; 722#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 723#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 > 0; 703#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 671#L556-4 [2018-11-10 04:38:37,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash -614155852, now seen corresponding path program 1 times [2018-11-10 04:38:37,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:37,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:37,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash 668529765, now seen corresponding path program 2 times [2018-11-10 04:38:37,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:37,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:38:37,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:38:37,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 04:38:37,464 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:38:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:38:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:38:37,465 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 04:38:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:38:37,629 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-11-10 04:38:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:38:37,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 85 transitions. [2018-11-10 04:38:37,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:38:37,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 40 states and 40 transitions. [2018-11-10 04:38:37,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 04:38:37,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 04:38:37,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 40 transitions. [2018-11-10 04:38:37,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:38:37,632 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-10 04:38:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 40 transitions. [2018-11-10 04:38:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2018-11-10 04:38:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 04:38:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-10 04:38:37,634 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-10 04:38:37,634 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-10 04:38:37,634 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:38:37,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 25 transitions. [2018-11-10 04:38:37,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:38:37,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:38:37,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:38:37,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:38:37,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:38:37,641 INFO L793 eck$LassoCheckResult]: Stem: 867#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 855#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 856#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 858#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 859#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 860#L556-5 assume true; 852#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 853#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 854#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 866#L555-3 assume test_fun_#t~short8; 868#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 869#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 > 0; 862#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 847#L556-4 [2018-11-10 04:38:37,641 INFO L795 eck$LassoCheckResult]: Loop: 847#L556-4 assume true; 857#L556-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 865#L556-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 848#L557 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 849#L557-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 850#L557-2 havoc test_fun_#t~mem10; 851#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 863#L558-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 864#L558-2 havoc test_fun_#t~mem11; 861#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559 845#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-1 846#L559-2 havoc test_fun_#t~mem12; 847#L556-4 [2018-11-10 04:38:37,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1752374477, now seen corresponding path program 1 times [2018-11-10 04:38:37,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:37,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:37,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:38:37,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:37,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 575827688, now seen corresponding path program 1 times [2018-11-10 04:38:37,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:37,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:37,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash -614155852, now seen corresponding path program 2 times [2018-11-10 04:38:37,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:38:37,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:38:37,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:38:37,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:38:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:38:38,105 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 112 [2018-11-10 04:38:38,224 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-10 04:38:38,226 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:38:38,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:38:38,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:38:38,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:38:38,227 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:38:38,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:38:38,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:38:38,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:38:38,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 04:38:38,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:38:38,227 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:38:38,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,588 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-10 04:38:38,732 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-10 04:38:38,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 04:38:38,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:38,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:39,208 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:38:39,208 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:38:39,209 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 04:38:39,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:39,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:39,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:39,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,215 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 04:38:39,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:39,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:39,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:39,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,218 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 04:38:39,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:39,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,222 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 04:38:39,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:39,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:39,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:39,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,224 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 04:38:39,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:39,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:39,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:39,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:38:39,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:39,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,231 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,231 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 04:38:39,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:39,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:39,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:39,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,234 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 04:38:39,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:39,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:39,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:39,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,237 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 04:38:39,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:38:39,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:38:39,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:38:39,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,239 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 04:38:39,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:39,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,245 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 04:38:39,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:39,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,250 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 04:38:39,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,250 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:38:39,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,259 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:38:39,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,264 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 04:38:39,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:39,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,268 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 04:38:39,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,269 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:38:39,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,271 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:38:39,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,285 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 04:38:39,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:39,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,290 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 04:38:39,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:39,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:38:39,311 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 04:38:39,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:38:39,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:38:39,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:38:39,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:38:39,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:38:39,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:38:39,326 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:38:39,338 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:38:39,338 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 04:38:39,338 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:38:39,341 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:38:39,341 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:38:39,341 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-10 04:38:39,447 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 04:38:39,449 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:38:39,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:38:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:39,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:38:39,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 04:38:39,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:39,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:39,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 04:38:39,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-10 04:38:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:38:39,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:38:39,574 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:39,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2018-11-10 04:38:39,589 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 42 treesize of output 37 [2018-11-10 04:38:39,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:39,626 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2018-11-10 04:38:39,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 04:38:39,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 04:38:39,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:38:39,685 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:37 [2018-11-10 04:38:39,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:39,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 04:38:39,735 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 34 treesize of output 25 [2018-11-10 04:38:39,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:38:39,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-10 04:38:39,781 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 31 treesize of output 24 [2018-11-10 04:38:39,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:38:39,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:35 [2018-11-10 04:38:39,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 04:38:39,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:38:39,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:38:39,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-11-10 04:38:39,849 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 04:38:39,850 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 04:38:39,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 25 transitions. cyclomatic complexity: 1 Second operand 10 states. [2018-11-10 04:38:39,938 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 25 transitions. cyclomatic complexity: 1. Second operand 10 states. Result 38 states and 39 transitions. Complement of second has 15 states. [2018-11-10 04:38:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 04:38:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 04:38:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-10 04:38:39,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-10 04:38:39,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:38:39,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 25 letters. Loop has 12 letters. [2018-11-10 04:38:39,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:38:39,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 13 letters. Loop has 24 letters. [2018-11-10 04:38:39,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:38:39,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2018-11-10 04:38:39,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:38:39,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2018-11-10 04:38:39,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:38:39,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:38:39,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:38:39,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:38:39,941 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:38:39,941 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:38:39,942 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:38:39,942 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:38:39,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:38:39,942 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:38:39,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:38:39,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:38:39 BoogieIcfgContainer [2018-11-10 04:38:39,948 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:38:39,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:38:39,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:38:39,948 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:38:39,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:38:32" (3/4) ... [2018-11-10 04:38:39,952 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:38:39,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:38:39,953 INFO L168 Benchmark]: Toolchain (without parser) took 7791.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 322.4 MB). Free memory was 956.5 MB in the beginning and 1.2 GB in the end (delta: -250.1 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:39,954 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:38:39,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.97 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.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 04:38:39,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:39,955 INFO L168 Benchmark]: Boogie Preprocessor took 24.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:38:39,955 INFO L168 Benchmark]: RCFGBuilder took 329.59 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:39,956 INFO L168 Benchmark]: BuchiAutomizer took 6991.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:39,956 INFO L168 Benchmark]: Witness Printer took 4.19 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:38:39,958 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.97 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.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 91.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 329.59 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6991.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.19 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 #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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 11 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 9 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 71 states and ocurred in iteration 3. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/3 HoareTripleCheckerStatistics: 108 SDtfs, 125 SDslu, 201 SDs, 0 SdLazy, 356 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital453 mio100 ax103 hnf100 lsp93 ukn55 mio100 lsp36 div100 bol100 ite100 ukn100 eq197 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 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...