./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.02-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_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/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 4500a3bcd7fcf54cd59518f595fee5012f1c8b44 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:03,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:03,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:03,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:03,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:03,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:03,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:03,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:03,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:03,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:03,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:03,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:03,130 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:03,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:03,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:03,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:03,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:03,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:03,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:03,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:03,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:03,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:03,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:03,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:03,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:03,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:03,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:03,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:03,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:03,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:03,150 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:03,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:03,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:03,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:03,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:03,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:03,153 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:03,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:03,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:03,169 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:03,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:03,169 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:03,169 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:03,169 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:03,170 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:03,170 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:03,170 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:03,170 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:03,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:03,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:03,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:03,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:03,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:03,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:03,171 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:03,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:03,172 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:03,174 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:03,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:03,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:03,174 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:03,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:03,175 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:03,175 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:03,176 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:03,176 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_fd18e5f7-9779-438a-8414-caf832a9f03f/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 -> 4500a3bcd7fcf54cd59518f595fee5012f1c8b44 [2018-10-27 06:06:03,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:03,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:03,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:03,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:03,228 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:03,228 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:06:03,287 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/data/5b54043b9/f0cc3f716e92460c89cc9ab25e6510ed/FLAG8720ab85c [2018-10-27 06:06:03,722 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:03,723 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/sv-benchmarks/c/termination-memory-alloca/c.02-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:06:03,733 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/data/5b54043b9/f0cc3f716e92460c89cc9ab25e6510ed/FLAG8720ab85c [2018-10-27 06:06:03,748 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/data/5b54043b9/f0cc3f716e92460c89cc9ab25e6510ed [2018-10-27 06:06:03,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:03,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:03,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:03,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:03,757 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:03,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:03" (1/1) ... [2018-10-27 06:06:03,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@250c3e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:03, skipping insertion in model container [2018-10-27 06:06:03,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:03" (1/1) ... [2018-10-27 06:06:03,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:03,810 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:04,088 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:04,101 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:04,166 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:04,223 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:04,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04 WrapperNode [2018-10-27 06:06:04,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:04,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:04,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:04,225 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:04,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:04,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:04,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:04,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:04,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:04,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:04,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:04,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:04,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/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-10-27 06:06:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:04,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:04,972 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:04,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:04 BoogieIcfgContainer [2018-10-27 06:06:04,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:04,974 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:04,974 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:04,978 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:04,979 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:04,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:03" (1/3) ... [2018-10-27 06:06:04,980 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@496c5ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:04, skipping insertion in model container [2018-10-27 06:06:04,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:04,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (2/3) ... [2018-10-27 06:06:04,981 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@496c5ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:04, skipping insertion in model container [2018-10-27 06:06:04,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:04,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:04" (3/3) ... [2018-10-27 06:06:04,983 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.02-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:06:05,051 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:05,052 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:05,052 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:05,052 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:05,053 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:05,056 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:05,056 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:05,056 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:05,057 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:05,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:06:05,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:06:05,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:05,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:05,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:05,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:05,131 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:05,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:06:05,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:06:05,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:05,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:05,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:05,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:05,147 INFO L793 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#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~mem8, test_fun_#t~mem11, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, 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; 12#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 14#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 29#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 21#L555-8true [2018-10-27 06:06:05,147 INFO L795 eck$LassoCheckResult]: Loop: 21#L555-8true 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 8#L555-1true test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 30#L555-2true assume !test_fun_#t~short7; 34#L555-6true assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 24#L556true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 26#L556-1true SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 27#L556-2true havoc test_fun_#t~mem8; 4#L557true SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 28#L558-4true assume !true; 10#L558-5true SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 16#L561true SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 18#L561-1true havoc test_fun_#t~mem12; 21#L555-8true [2018-10-27 06:06:05,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-10-27 06:06:05,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:05,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:05,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2104325740, now seen corresponding path program 1 times [2018-10-27 06:06:05,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:05,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:05,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:05,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:05,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:05,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:05,412 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:05,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:05,427 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-10-27 06:06:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:05,505 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-10-27 06:06:05,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:05,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-10-27 06:06:05,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:06:05,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 27 transitions. [2018-10-27 06:06:05,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-10-27 06:06:05,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:06:05,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2018-10-27 06:06:05,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:05,517 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-10-27 06:06:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2018-10-27 06:06:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-27 06:06:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:06:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-10-27 06:06:05,548 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-10-27 06:06:05,548 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-10-27 06:06:05,548 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:05,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2018-10-27 06:06:05,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:06:05,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:05,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:05,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:05,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:05,550 INFO L793 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 81#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~mem8, test_fun_#t~mem11, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, 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; 82#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 85#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 88#L555-8 [2018-10-27 06:06:05,550 INFO L795 eck$LassoCheckResult]: Loop: 88#L555-8 assume true; 78#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 79#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 80#L555-2 assume test_fun_#t~short7; 96#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 98#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 99#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 93#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 94#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 95#L556-2 havoc test_fun_#t~mem8; 77#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 76#L558-4 assume true; 90#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 91#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 92#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 83#L558-5 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 84#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 87#L561-1 havoc test_fun_#t~mem12; 88#L555-8 [2018-10-27 06:06:05,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:05,551 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-10-27 06:06:05,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:05,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:05,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:05,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:05,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1474363080, now seen corresponding path program 1 times [2018-10-27 06:06:05,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:05,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:05,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1406679464, now seen corresponding path program 1 times [2018-10-27 06:06:05,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:05,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:06,360 WARN L179 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-10-27 06:06:07,501 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-10-27 06:06:07,663 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-10-27 06:06:07,676 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:07,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:07,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:07,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:07,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:07,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:07,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:07,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:07,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-10-27 06:06:07,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:07,679 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:07,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:07,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:07,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:07,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:07,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:07,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,332 WARN L179 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-10-27 06:06:08,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,986 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-27 06:06:09,168 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:09,173 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:09,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:09,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:09,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:09,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:09,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:09,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:09,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:09,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:09,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:09,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:09,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:09,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:09,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:09,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:09,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,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-10-27 06:06:09,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,222 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:09,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,227 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:09,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,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-10-27 06:06:09,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:09,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:09,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,270 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:09,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,275 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:09,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,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-10-27 06:06:09,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:09,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:09,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,295 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:09,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,299 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:09,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:09,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:09,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:09,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:09,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:09,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:09,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:09,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:09,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:09,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:09,336 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:09,345 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:09,345 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:06:09,347 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:09,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:09,350 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:09,351 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) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2018-10-27 06:06:09,595 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-10-27 06:06:09,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:09,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:09,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:09,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:09,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-27 06:06:09,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 06:06:09,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:09,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:09,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:09,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-10-27 06:06:09,852 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 11 treesize of output 8 [2018-10-27 06:06:09,855 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 8 treesize of output 7 [2018-10-27 06:06:09,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:09,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:09,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:09,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-10-27 06:06:10,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:10,268 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-10-27 06:06:10,426 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 39 treesize of output 53 [2018-10-27 06:06:10,434 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 44 treesize of output 37 [2018-10-27 06:06:10,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:10,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:10,481 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:10,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 50 [2018-10-27 06:06:10,493 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:06:10,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:10,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-10-27 06:06:10,541 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:52 [2018-10-27 06:06:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:10,583 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-10-27 06:06:10,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2 Second operand 12 states. [2018-10-27 06:06:11,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2. Second operand 12 states. Result 84 states and 89 transitions. Complement of second has 24 states. [2018-10-27 06:06:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:06:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 47 transitions. [2018-10-27 06:06:11,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 5 letters. Loop has 18 letters. [2018-10-27 06:06:11,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:11,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 23 letters. Loop has 18 letters. [2018-10-27 06:06:11,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:11,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 5 letters. Loop has 36 letters. [2018-10-27 06:06:11,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:11,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 89 transitions. [2018-10-27 06:06:11,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-10-27 06:06:11,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 82 states and 87 transitions. [2018-10-27 06:06:11,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:06:11,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-10-27 06:06:11,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 87 transitions. [2018-10-27 06:06:11,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:11,726 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-10-27 06:06:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 87 transitions. [2018-10-27 06:06:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2018-10-27 06:06:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 06:06:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-10-27 06:06:11,732 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-10-27 06:06:11,732 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-10-27 06:06:11,732 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:11,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 64 transitions. [2018-10-27 06:06:11,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-10-27 06:06:11,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:11,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:11,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:11,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:11,739 INFO L793 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 414#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~mem8, test_fun_#t~mem11, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, 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; 415#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 420#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 421#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 443#L555-8 assume true; 408#L555 [2018-10-27 06:06:11,739 INFO L795 eck$LassoCheckResult]: Loop: 408#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 409#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 412#L555-2 assume test_fun_#t~short7; 441#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 445#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 447#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 435#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 436#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 439#L556-2 havoc test_fun_#t~mem8; 402#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 403#L558-4 assume true; 429#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 430#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 433#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 427#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 398#L559-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: L559-1 399#L559-2 havoc test_fun_#t~mem11; 406#L558-4 assume true; 451#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 450#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 449#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 416#L558-5 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 417#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 422#L561-1 havoc test_fun_#t~mem12; 424#L555-8 assume true; 408#L555 [2018-10-27 06:06:11,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash 889444104, now seen corresponding path program 1 times [2018-10-27 06:06:11,740 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:11,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1035340172, now seen corresponding path program 1 times [2018-10-27 06:06:11,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:11,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1201191603, now seen corresponding path program 1 times [2018-10-27 06:06:11,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:11,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:11,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:11,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:12,026 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-10-27 06:06:12,254 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-10-27 06:06:12,363 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-10-27 06:06:12,365 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:12,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:12,366 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:12,366 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:12,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:12,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:12,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:12,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:12,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-10-27 06:06:12,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:12,366 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:12,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,774 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-10-27 06:06:12,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,324 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:13,324 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:13,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:13,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:13,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:13,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:13,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:13,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:13,357 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:13,362 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:13,362 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:13,362 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:13,363 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:13,363 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:13,364 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-10-27 06:06:13,553 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-10-27 06:06:13,554 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:13,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:13,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:13,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:13,717 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 35 treesize of output 26 [2018-10-27 06:06:13,722 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 0 case distinctions, treesize of input 26 treesize of output 19 [2018-10-27 06:06:13,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:13,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:13,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:13,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:06:13,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 06:06:13,764 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 22 treesize of output 21 [2018-10-27 06:06:13,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:13,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:13,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:13,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-27 06:06:13,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-10-27 06:06:13,935 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-10-27 06:06:13,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:13,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:13,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:13,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-10-27 06:06:13,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:14,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:14,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:14,039 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:50, output treesize:60 [2018-10-27 06:06:14,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:14,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-10-27 06:06:14,403 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:06:14,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-10-27 06:06:14,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:14,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:14,479 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:14,481 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-10-27 06:06:14,484 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 45 treesize of output 34 [2018-10-27 06:06:14,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:14,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:14,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 06:06:14,521 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:119, output treesize:73 [2018-10-27 06:06:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:14,584 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2018-10-27 06:06:14,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 64 transitions. cyclomatic complexity: 7 Second operand 18 states. [2018-10-27 06:06:15,149 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-10-27 06:06:15,517 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 64 transitions. cyclomatic complexity: 7. Second operand 18 states. Result 208 states and 220 transitions. Complement of second has 37 states. [2018-10-27 06:06:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:06:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2018-10-27 06:06:15,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 45 transitions. Stem has 6 letters. Loop has 25 letters. [2018-10-27 06:06:15,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:15,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 45 transitions. Stem has 31 letters. Loop has 25 letters. [2018-10-27 06:06:15,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:15,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 45 transitions. Stem has 6 letters. Loop has 50 letters. [2018-10-27 06:06:15,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:15,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 220 transitions. [2018-10-27 06:06:15,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-10-27 06:06:15,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 180 states and 192 transitions. [2018-10-27 06:06:15,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-10-27 06:06:15,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-10-27 06:06:15,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 192 transitions. [2018-10-27 06:06:15,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:15,525 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-10-27 06:06:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 192 transitions. [2018-10-27 06:06:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2018-10-27 06:06:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 06:06:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-10-27 06:06:15,537 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-10-27 06:06:15,537 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-10-27 06:06:15,537 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:06:15,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 161 transitions. [2018-10-27 06:06:15,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-10-27 06:06:15,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:15,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:15,542 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] [2018-10-27 06:06:15,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:15,542 INFO L793 eck$LassoCheckResult]: Stem: 985#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 945#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~mem8, test_fun_#t~mem11, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, 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; 946#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 951#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 952#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 964#L555-8 assume true; 965#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 938#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 981#L555-2 assume test_fun_#t~short7; 982#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 990#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 991#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 971#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 972#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 979#L556-2 havoc test_fun_#t~mem8; 980#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1007#L558-4 assume true; 1006#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1005#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1004#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 1003#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 1002#L559-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: L559-1 931#L559-2 havoc test_fun_#t~mem11; 932#L558-4 [2018-10-27 06:06:15,543 INFO L795 eck$LassoCheckResult]: Loop: 932#L558-4 assume true; 960#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 961#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 968#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 958#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 927#L559-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: L559-1 928#L559-2 havoc test_fun_#t~mem11; 1001#L558-4 assume true; 1000#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 999#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 998#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 947#L558-5 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 948#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 953#L561-1 havoc test_fun_#t~mem12; 955#L555-8 assume true; 1008#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 941#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 942#L555-2 assume test_fun_#t~short7; 986#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 987#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 994#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 995#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 975#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 976#L556-2 havoc test_fun_#t~mem8; 934#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 932#L558-4 [2018-10-27 06:06:15,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1406625840, now seen corresponding path program 1 times [2018-10-27 06:06:15,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:15,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1191060236, now seen corresponding path program 2 times [2018-10-27 06:06:15,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash -963141091, now seen corresponding path program 2 times [2018-10-27 06:06:15,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,928 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-10-27 06:06:16,964 WARN L179 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 139 [2018-10-27 06:06:17,219 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-10-27 06:06:17,221 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:17,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:17,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:17,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:17,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:17,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:17,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:17,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:17,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-10-27 06:06:17,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:17,222 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:17,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,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-10-27 06:06:17,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-10-27 06:06:17,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-10-27 06:06:17,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,555 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-10-27 06:06:17,669 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-10-27 06:06:17,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:17,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,422 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:18,423 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:18,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:18,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:18,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:18,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:18,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:18,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:18,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:18,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:18,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:18,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,520 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:18,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,525 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:18,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,559 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:18,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,564 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:18,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:18,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:18,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:18,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:18,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:18,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:18,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:18,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:18,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:18,616 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:06:18,616 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:06:18,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:18,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:18,618 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:18,618 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-10-27 06:06:18,868 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-10-27 06:06:18,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:18,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:18,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:18,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:19,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-10-27 06:06:19,109 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 0 case distinctions, treesize of input 38 treesize of output 33 [2018-10-27 06:06:19,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:19,164 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:19,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-10-27 06:06:19,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:19,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:19,199 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-10-27 06:06:19,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:19,382 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-10-27 06:06:19,388 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 47 treesize of output 36 [2018-10-27 06:06:19,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:19,457 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 57 treesize of output 50 [2018-10-27 06:06:19,460 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:06:19,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-10-27 06:06:19,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:19,482 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:50 [2018-10-27 06:06:19,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 52 [2018-10-27 06:06:19,659 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 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 06:06:19,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:19,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:19,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:19,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 57 [2018-10-27 06:06:19,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:19,717 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:28 [2018-10-27 06:06:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:19,736 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 16 loop predicates [2018-10-27 06:06:19,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 18 states. [2018-10-27 06:06:20,286 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14. Second operand 18 states. Result 386 states and 407 transitions. Complement of second has 29 states. [2018-10-27 06:06:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:06:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2018-10-27 06:06:20,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 23 letters. Loop has 25 letters. [2018-10-27 06:06:20,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:20,290 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:20,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:20,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:20,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:20,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-10-27 06:06:20,423 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 0 case distinctions, treesize of input 38 treesize of output 33 [2018-10-27 06:06:20,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:20,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:20,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:20,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-10-27 06:06:20,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:20,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:20,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:20,485 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-10-27 06:06:20,631 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:20,631 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 57 treesize of output 50 [2018-10-27 06:06:20,635 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:06:20,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-10-27 06:06:20,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:20,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:20,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:20,669 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-10-27 06:06:20,673 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 47 treesize of output 36 [2018-10-27 06:06:20,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:20,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:20,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:20,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:50 [2018-10-27 06:06:20,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 52 [2018-10-27 06:06:20,857 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 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 06:06:20,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:20,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:20,956 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:20,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:21,017 INFO L303 Elim1Store]: Index analysis took 131 ms [2018-10-27 06:06:21,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 57 [2018-10-27 06:06:21,018 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:21,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:21,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:21,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:28 [2018-10-27 06:06:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:21,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 16 loop predicates [2018-10-27 06:06:21,078 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 18 states. [2018-10-27 06:06:21,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14. Second operand 18 states. Result 408 states and 432 transitions. Complement of second has 37 states. [2018-10-27 06:06:21,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:06:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2018-10-27 06:06:21,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 55 transitions. Stem has 23 letters. Loop has 25 letters. [2018-10-27 06:06:21,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:21,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 55 transitions. Stem has 48 letters. Loop has 25 letters. [2018-10-27 06:06:21,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:21,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 55 transitions. Stem has 23 letters. Loop has 50 letters. [2018-10-27 06:06:21,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:21,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 432 transitions. [2018-10-27 06:06:21,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:06:21,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 354 states and 375 transitions. [2018-10-27 06:06:21,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2018-10-27 06:06:21,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-10-27 06:06:21,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 375 transitions. [2018-10-27 06:06:21,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:21,486 INFO L705 BuchiCegarLoop]: Abstraction has 354 states and 375 transitions. [2018-10-27 06:06:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 375 transitions. [2018-10-27 06:06:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 292. [2018-10-27 06:06:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-27 06:06:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 313 transitions. [2018-10-27 06:06:21,501 INFO L728 BuchiCegarLoop]: Abstraction has 292 states and 313 transitions. [2018-10-27 06:06:21,501 INFO L608 BuchiCegarLoop]: Abstraction has 292 states and 313 transitions. [2018-10-27 06:06:21,501 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:06:21,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 313 transitions. [2018-10-27 06:06:21,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:06:21,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:21,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:21,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:21,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:21,508 INFO L793 eck$LassoCheckResult]: Stem: 2455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2416#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~mem8, test_fun_#t~mem11, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, 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; 2417#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 2422#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 2423#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 2437#L555-8 assume true; 2409#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 2410#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 2414#L555-2 assume test_fun_#t~short7; 2453#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 2456#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 2458#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 2445#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 2446#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 2449#L556-2 havoc test_fun_#t~mem8; 2405#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 2406#L558-4 assume true; 2604#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 2603#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 2442#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 2443#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 2398#L559-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: L559-1 2399#L559-2 havoc test_fun_#t~mem11; 2602#L558-4 assume true; 2433#L558 [2018-10-27 06:06:21,508 INFO L795 eck$LassoCheckResult]: Loop: 2433#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 2434#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 2440#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 2430#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 2431#L559-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: L559-1 2402#L559-2 havoc test_fun_#t~mem11; 2403#L558-4 assume true; 2433#L558 [2018-10-27 06:06:21,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:21,508 INFO L82 PathProgramCache]: Analyzing trace with hash -655728047, now seen corresponding path program 2 times [2018-10-27 06:06:21,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:21,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:21,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:21,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:21,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:21,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash -484491459, now seen corresponding path program 1 times [2018-10-27 06:06:21,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:21,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:21,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:21,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1199529235, now seen corresponding path program 3 times [2018-10-27 06:06:21,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:21,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:21,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:21,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:21,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:21,752 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:06:22,322 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2018-10-27 06:06:22,465 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:06:22,467 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:22,467 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:22,467 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:22,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:22,467 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:22,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:22,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:22,467 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:22,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-10-27 06:06:22,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:22,467 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:22,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,817 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2018-10-27 06:06:22,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:22,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,260 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:23,260 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:23,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:23,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:23,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:23,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:23,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:23,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:23,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:23,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:23,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:23,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:23,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:23,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:23,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:23,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:23,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:23,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:23,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:23,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:23,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:23,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:23,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:23,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:23,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:23,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:23,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:23,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:23,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:23,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,333 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:23,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,333 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:23,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,349 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:23,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,350 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:23,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:23,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:23,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:23,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:23,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:23,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:23,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:23,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:23,377 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:23,385 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:23,385 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:23,385 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:23,386 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:23,386 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:23,386 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)_4, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 Supporting invariants [] [2018-10-27 06:06:23,968 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-10-27 06:06:23,989 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:23,989 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:24,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:24,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:24,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:24,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:24,161 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 47 treesize of output 59 [2018-10-27 06:06:24,164 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 50 treesize of output 41 [2018-10-27 06:06:24,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:24,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:24,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:24,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:24,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-10-27 06:06:24,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:24,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:24,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:24,217 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-10-27 06:06:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:24,238 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:24,238 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 292 states and 313 transitions. cyclomatic complexity: 29 Second operand 7 states. [2018-10-27 06:06:24,264 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 292 states and 313 transitions. cyclomatic complexity: 29. Second operand 7 states. Result 429 states and 455 transitions. Complement of second has 13 states. [2018-10-27 06:06:24,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-10-27 06:06:24,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 24 letters. Loop has 7 letters. [2018-10-27 06:06:24,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:24,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 31 letters. Loop has 7 letters. [2018-10-27 06:06:24,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:24,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 24 letters. Loop has 14 letters. [2018-10-27 06:06:24,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:24,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 455 transitions. [2018-10-27 06:06:24,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:06:24,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 372 states and 394 transitions. [2018-10-27 06:06:24,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-10-27 06:06:24,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-10-27 06:06:24,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 394 transitions. [2018-10-27 06:06:24,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:24,270 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 394 transitions. [2018-10-27 06:06:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 394 transitions. [2018-10-27 06:06:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2018-10-27 06:06:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-27 06:06:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 336 transitions. [2018-10-27 06:06:24,286 INFO L728 BuchiCegarLoop]: Abstraction has 314 states and 336 transitions. [2018-10-27 06:06:24,286 INFO L608 BuchiCegarLoop]: Abstraction has 314 states and 336 transitions. [2018-10-27 06:06:24,286 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:06:24,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 336 transitions. [2018-10-27 06:06:24,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:06:24,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:24,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:24,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:24,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:24,289 INFO L793 eck$LassoCheckResult]: Stem: 3383#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3347#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~mem8, test_fun_#t~mem11, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, 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; 3348#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 3353#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 3354#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 3382#L555-8 assume true; 3516#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 3555#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 3600#L555-2 assume test_fun_#t~short7; 3599#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 3597#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 3492#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 3493#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3481#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 3482#L556-2 havoc test_fun_#t~mem8; 3471#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 3472#L558-4 assume true; 3589#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 3588#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3445#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 3428#L558-5 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 3425#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 3423#L561-1 havoc test_fun_#t~mem12; 3422#L555-8 assume true; 3421#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 3420#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 3419#L555-2 assume test_fun_#t~short7; 3418#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 3417#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 3416#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 3413#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3412#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 3411#L556-2 havoc test_fun_#t~mem8; 3410#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 3409#L558-4 assume true; 3408#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 3407#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3406#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 3405#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3329#L559-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: L559-1 3330#L559-2 havoc test_fun_#t~mem11; 3394#L558-4 assume true; 3395#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 3390#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3391#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 3349#L558-5 [2018-10-27 06:06:24,289 INFO L795 eck$LassoCheckResult]: Loop: 3349#L558-5 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 3350#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 3355#L561-1 havoc test_fun_#t~mem12; 3357#L555-8 assume true; 3341#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 3342#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 3345#L555-2 assume test_fun_#t~short7; 3380#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 3384#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 3527#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 3526#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3374#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 3375#L556-2 havoc test_fun_#t~mem8; 3525#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 3338#L558-4 assume true; 3363#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 3364#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3367#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 3360#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3361#L559-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: L559-1 3397#L559-2 havoc test_fun_#t~mem11; 3398#L558-4 assume true; 3392#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 3393#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3389#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 3349#L558-5 [2018-10-27 06:06:24,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1309614612, now seen corresponding path program 3 times [2018-10-27 06:06:24,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:24,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:24,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:24,829 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-10-27 06:06:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 06:06:24,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:24,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:06:24,893 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:24,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1415115844, now seen corresponding path program 3 times [2018-10-27 06:06:24,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:24,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:24,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:24,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:25,091 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-10-27 06:06:25,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:06:25,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:06:25,132 INFO L87 Difference]: Start difference. First operand 314 states and 336 transitions. cyclomatic complexity: 32 Second operand 10 states. [2018-10-27 06:06:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:25,230 INFO L93 Difference]: Finished difference Result 303 states and 317 transitions. [2018-10-27 06:06:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:06:25,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 317 transitions. [2018-10-27 06:06:25,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2018-10-27 06:06:25,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 147 states and 153 transitions. [2018-10-27 06:06:25,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-10-27 06:06:25,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-10-27 06:06:25,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 153 transitions. [2018-10-27 06:06:25,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:25,239 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-10-27 06:06:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 153 transitions. [2018-10-27 06:06:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-10-27 06:06:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-27 06:06:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-10-27 06:06:25,243 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-10-27 06:06:25,243 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-10-27 06:06:25,243 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:06:25,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 140 transitions. [2018-10-27 06:06:25,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:06:25,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:25,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:25,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:25,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:25,250 INFO L793 eck$LassoCheckResult]: Stem: 4034#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3991#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~mem8, test_fun_#t~mem11, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, 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; 3992#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 3997#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 3998#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 4029#L555-8 assume true; 4053#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 3986#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 4032#L555-2 assume test_fun_#t~short7; 4033#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 4072#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 4071#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 4019#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 4020#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 4027#L556-2 havoc test_fun_#t~mem8; 4028#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 4069#L558-4 assume true; 4068#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4067#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4066#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 4065#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 4064#L559-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: L559-1 4063#L559-2 havoc test_fun_#t~mem11; 4062#L558-4 assume true; 4061#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4060#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4055#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 4056#L558-5 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 4000#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 4001#L561-1 havoc test_fun_#t~mem12; 4057#L555-8 assume true; 3983#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 3984#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 4030#L555-2 assume test_fun_#t~short7; 4031#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 4039#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 4040#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 4017#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 4018#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 4025#L556-2 havoc test_fun_#t~mem8; 4026#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 4087#L558-4 assume true; 4086#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4085#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4084#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 4082#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3971#L559-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: L559-1 3972#L559-2 havoc test_fun_#t~mem11; 4054#L558-4 [2018-10-27 06:06:25,250 INFO L795 eck$LassoCheckResult]: Loop: 4054#L558-4 assume true; 4052#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4051#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4050#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 4044#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 4049#L559-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: L559-1 4048#L559-2 havoc test_fun_#t~mem11; 4047#L558-4 assume true; 4046#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4045#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4043#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 3993#L558-5 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 3994#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 3999#L561-1 havoc test_fun_#t~mem12; 4002#L555-8 assume true; 4012#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 4083#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 4080#L555-2 assume test_fun_#t~short7; 4079#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 4078#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 4077#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 4075#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 4074#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 4073#L556-2 havoc test_fun_#t~mem8; 4070#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 4054#L558-4 [2018-10-27 06:06:25,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1516184533, now seen corresponding path program 4 times [2018-10-27 06:06:25,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:25,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:25,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:25,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:25,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:25,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:25,557 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd18e5f7-9779-438a-8414-caf832a9f03f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:06:25,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:25,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:06:25,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:25,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:25,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:06:25,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:06:25,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:06:25,750 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 8 treesize of output 7 [2018-10-27 06:06:25,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:06:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-10-27 06:06:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:06:25,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-10-27 06:06:25,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:25,865 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-10-27 06:06:25,886 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 33 treesize of output 26 [2018-10-27 06:06:25,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2018-10-27 06:06:25,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-10-27 06:06:25,954 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-27 06:06:25,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:25,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:25 [2018-10-27 06:06:26,008 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 32 treesize of output 29 [2018-10-27 06:06:26,010 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 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 06:06:26,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:26,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:26,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:26,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-10-27 06:06:26,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-10-27 06:06:26,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 06:06:26,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:26,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:06:26,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:26,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:26,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:26,253 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-10-27 06:06:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:26,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:26,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 29 [2018-10-27 06:06:26,322 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:26,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:26,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1191060236, now seen corresponding path program 4 times [2018-10-27 06:06:26,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:26,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:26,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:26,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:26,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:26,733 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-10-27 06:06:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 06:06:26,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-10-27 06:06:26,765 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. cyclomatic complexity: 11 Second operand 29 states. [2018-10-27 06:06:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:27,205 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-10-27 06:06:27,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 06:06:27,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 170 transitions. [2018-10-27 06:06:27,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:06:27,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 93 states and 96 transitions. [2018-10-27 06:06:27,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-10-27 06:06:27,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-10-27 06:06:27,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 96 transitions. [2018-10-27 06:06:27,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:27,208 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-10-27 06:06:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 96 transitions. [2018-10-27 06:06:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2018-10-27 06:06:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-27 06:06:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-10-27 06:06:27,210 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-10-27 06:06:27,210 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-10-27 06:06:27,210 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:06:27,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 76 transitions. [2018-10-27 06:06:27,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:06:27,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:27,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:27,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:27,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:27,220 INFO L793 eck$LassoCheckResult]: Stem: 4508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4480#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~mem8, test_fun_#t~mem11, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, 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; 4481#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 4484#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 4485#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 4495#L555-8 assume true; 4474#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 4475#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 4478#L555-2 assume test_fun_#t~short7; 4506#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 4509#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 4511#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 4499#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 4500#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 4503#L556-2 havoc test_fun_#t~mem8; 4467#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 4468#L558-4 assume true; 4491#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4492#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4524#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 4520#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 4521#L559-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: L559-1 4472#L559-2 havoc test_fun_#t~mem11; 4473#L558-4 assume true; 4493#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4494#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4498#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 4489#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 4490#L559-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: L559-1 4519#L559-2 havoc test_fun_#t~mem11; 4527#L558-4 assume true; 4533#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4532#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4513#L558-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 4482#L558-5 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-5 4483#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 2, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 4486#L561-1 havoc test_fun_#t~mem12; 4487#L555-8 assume true; 4476#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 4477#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 >= 0; 4479#L555-2 assume test_fun_#t~short7; 4507#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 4510#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 < 2147483647; 4512#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 4501#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 4502#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 4504#L556-2 havoc test_fun_#t~mem8; 4469#L557 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 4470#L558-4 assume true; 4505#L558 [2018-10-27 06:06:27,220 INFO L795 eck$LassoCheckResult]: Loop: 4505#L558 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 4496#L558-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 4497#L558-2 assume !!(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 4488#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 4463#L559-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: L559-1 4464#L559-2 havoc test_fun_#t~mem11; 4471#L558-4 assume true; 4505#L558 [2018-10-27 06:06:27,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash 207397284, now seen corresponding path program 5 times [2018-10-27 06:06:27,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:27,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:27,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:27,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:27,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:27,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash -484491459, now seen corresponding path program 2 times [2018-10-27 06:06:27,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:27,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:27,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:27,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:27,275 INFO L82 PathProgramCache]: Analyzing trace with hash 953880634, now seen corresponding path program 6 times [2018-10-27 06:06:27,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:27,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:27,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:27,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:27,491 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:06:31,060 WARN L179 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2018-10-27 06:06:31,808 WARN L179 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-10-27 06:06:31,812 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:31,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:31,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:31,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:31,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:31,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:31,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:31,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:31,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-10-27 06:06:31,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:31,812 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:31,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:31,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:31,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,714 WARN L179 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 103 [2018-10-27 06:06:32,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:33,074 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 06:06:33,505 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:33,505 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:33,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:33,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:33,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:33,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,512 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:33,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,529 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:33,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,533 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:33,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:33,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,598 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:33,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,599 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:33,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:33,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:06:33,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:33,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:33,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:33,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:33,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:33,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:33,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:33,672 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:06:33,680 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:33,680 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:33,681 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:33,681 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:33,681 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)_5, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5 Supporting invariants [] [2018-10-27 06:06:33,950 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-10-27 06:06:33,951 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:33,952 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:33,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:33,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:34,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:34,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,070 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 47 treesize of output 59 [2018-10-27 06:06:34,074 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 50 treesize of output 41 [2018-10-27 06:06:34,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:34,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-10-27 06:06:34,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:34,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:34,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:34,136 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-10-27 06:06:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:34,157 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:34,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-10-27 06:06:34,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 91 states and 95 transitions. Complement of second has 13 states. [2018-10-27 06:06:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-10-27 06:06:34,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 49 letters. Loop has 7 letters. [2018-10-27 06:06:34,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:34,192 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:34,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:34,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:34,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:34,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,305 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 47 treesize of output 59 [2018-10-27 06:06:34,308 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 50 treesize of output 41 [2018-10-27 06:06:34,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:34,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-10-27 06:06:34,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:34,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:34,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:34,380 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-10-27 06:06:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:34,405 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:34,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-10-27 06:06:34,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 91 states and 95 transitions. Complement of second has 15 states. [2018-10-27 06:06:34,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-10-27 06:06:34,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 49 letters. Loop has 7 letters. [2018-10-27 06:06:34,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:34,495 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:34,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:34,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:34,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:34,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,665 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 47 treesize of output 59 [2018-10-27 06:06:34,668 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 50 treesize of output 41 [2018-10-27 06:06:34,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:34,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:34,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-10-27 06:06:34,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:34,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:34,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:34,745 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-10-27 06:06:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:34,767 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:34,767 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-10-27 06:06:34,853 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 112 states and 118 transitions. Complement of second has 14 states. [2018-10-27 06:06:34,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-10-27 06:06:34,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 49 letters. Loop has 7 letters. [2018-10-27 06:06:34,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:34,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 56 letters. Loop has 7 letters. [2018-10-27 06:06:34,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:34,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 49 letters. Loop has 14 letters. [2018-10-27 06:06:34,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:34,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 118 transitions. [2018-10-27 06:06:34,861 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:34,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 0 states and 0 transitions. [2018-10-27 06:06:34,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:34,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:34,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:34,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:34,862 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:34,862 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:34,862 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:34,862 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:06:34,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:34,862 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:34,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:34,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:34 BoogieIcfgContainer [2018-10-27 06:06:34,877 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:34,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:34,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:34,878 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:34,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:04" (3/4) ... [2018-10-27 06:06:34,895 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:34,895 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:34,895 INFO L168 Benchmark]: Toolchain (without parser) took 31143.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.9 MB). Free memory was 951.8 MB in the beginning and 1.2 GB in the end (delta: -204.7 MB). Peak memory consumption was 214.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:34,898 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:34,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:34,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -242.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:34,899 INFO L168 Benchmark]: Boogie Preprocessor took 26.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:34,899 INFO L168 Benchmark]: RCFGBuilder took 595.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:34,900 INFO L168 Benchmark]: BuchiAutomizer took 29904.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -10.5 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:34,900 INFO L168 Benchmark]: Witness Printer took 16.86 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-10-27 06:06:34,902 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 470.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 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 124.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -242.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 595.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29904.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -10.5 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. * Witness Printer took 16.86 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 13 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 19 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 19 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 29 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.8s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 21.0s. Construction of modules took 1.4s. Büchi inclusion checks took 7.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 205 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 314 states and ocurred in iteration 5. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/8 HoareTripleCheckerStatistics: 258 SDtfs, 434 SDslu, 566 SDs, 0 SdLazy, 1135 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital1252 mio100 ax102 hnf100 lsp96 ukn30 mio100 lsp35 div100 bol100 ite100 ukn100 eq196 hnf87 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms 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...