./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_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/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_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/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-11-10 10:44:34,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:44:34,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:44:34,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:44:34,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:44:34,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:44:34,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:44:34,066 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:44:34,067 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:44:34,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:44:34,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:44:34,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:44:34,069 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:44:34,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:44:34,070 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:44:34,071 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:44:34,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:44:34,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:44:34,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:44:34,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:44:34,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:44:34,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:44:34,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:44:34,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:44:34,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:44:34,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:44:34,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:44:34,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:44:34,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:44:34,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:44:34,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:44:34,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:44:34,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:44:34,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:44:34,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:44:34,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:44:34,084 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 10:44:34,093 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:44:34,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:44:34,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:44:34,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:44:34,094 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:44:34,094 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:44:34,094 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:44:34,099 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:44:34,099 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:44:34,099 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:44:34,099 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:44:34,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:44:34,100 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:44:34,100 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:44:34,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:44:34,100 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:44:34,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:44:34,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:44:34,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:44:34,101 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:44:34,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:44:34,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:44:34,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:44:34,101 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:44:34,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:44:34,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:44:34,102 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:44:34,102 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:44:34,102 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_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/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-11-10 10:44:34,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:44:34,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:44:34,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:44:34,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:44:34,136 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:44:34,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:44:34,171 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/data/4716df029/9eedc62c064e4fc68a6ba982e9042cfa/FLAG072430cfa [2018-11-10 10:44:34,587 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:44:34,588 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/sv-benchmarks/c/termination-memory-alloca/c.02-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:44:34,595 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/data/4716df029/9eedc62c064e4fc68a6ba982e9042cfa/FLAG072430cfa [2018-11-10 10:44:34,605 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/data/4716df029/9eedc62c064e4fc68a6ba982e9042cfa [2018-11-10 10:44:34,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:44:34,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:44:34,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:44:34,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:44:34,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:44:34,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5970c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34, skipping insertion in model container [2018-11-10 10:44:34,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:44:34,647 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:44:34,817 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:44:34,826 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:44:34,850 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:44:34,881 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:44:34,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34 WrapperNode [2018-11-10 10:44:34,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:44:34,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:44:34,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:44:34,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:44:34,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:44:34,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:44:34,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:44:34,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:44:34,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... [2018-11-10 10:44:34,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:44:34,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:44:34,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:44:34,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:44:34,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:44:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:44:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:44:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:44:35,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:44:35,247 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:44:35,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:44:35 BoogieIcfgContainer [2018-11-10 10:44:35,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:44:35,248 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:44:35,248 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:44:35,250 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:44:35,251 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:44:35,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:44:34" (1/3) ... [2018-11-10 10:44:35,252 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d96658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:44:35, skipping insertion in model container [2018-11-10 10:44:35,252 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:44:35,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:34" (2/3) ... [2018-11-10 10:44:35,252 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d96658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:44:35, skipping insertion in model container [2018-11-10 10:44:35,252 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:44:35,253 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:44:35" (3/3) ... [2018-11-10 10:44:35,254 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.02-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:44:35,290 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:44:35,291 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:44:35,291 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:44:35,291 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:44:35,291 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:44:35,291 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:44:35,291 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:44:35,291 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:44:35,292 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:44:35,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 10:44:35,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 10:44:35,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:35,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:35,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:44:35,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:35,322 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:44:35,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 10:44:35,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 10:44:35,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:35,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:35,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:44:35,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:35,330 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-11-10 10:44:35,330 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~short7;havoc test_fun_#t~mem5; 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-11-10 10:44:35,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 10:44:35,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:35,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2104325740, now seen corresponding path program 1 times [2018-11-10 10:44:35,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:35,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:35,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:35,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:44:35,481 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:44:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:44:35,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:44:35,492 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-10 10:44:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:35,511 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-10 10:44:35,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:44:35,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-10 10:44:35,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 10:44:35,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 27 transitions. [2018-11-10 10:44:35,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 10:44:35,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 10:44:35,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2018-11-10 10:44:35,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:44:35,521 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 10:44:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2018-11-10 10:44:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 10:44:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 10:44:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-10 10:44:35,541 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 10:44:35,541 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 10:44:35,541 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:44:35,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2018-11-10 10:44:35,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 10:44:35,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:35,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:35,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:44:35,543 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-11-10 10:44:35,543 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-11-10 10:44:35,543 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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-11-10 10:44:35,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 10:44:35,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:35,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:35,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:35,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:35,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:35,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1474363080, now seen corresponding path program 1 times [2018-11-10 10:44:35,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:35,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:35,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1406679464, now seen corresponding path program 1 times [2018-11-10 10:44:35,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:35,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:35,800 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-11-10 10:44:36,043 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 10:44:36,142 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:44:36,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:44:36,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:44:36,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:44:36,144 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:44:36,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:44:36,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:44:36,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:44:36,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 10:44:36,145 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:44:36,145 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:44:36,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,468 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-10 10:44:36,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:36,988 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:44:36,992 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:44:36,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:36,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:36,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:36,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:36,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:36,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:36,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:36,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:36,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:36,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:36,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:36,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:37,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:37,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:37,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:37,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:37,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:37,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:37,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:37,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:37,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:37,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:37,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,019 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:37,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,021 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:37,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:37,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:37,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,057 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:37,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,059 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:37,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:37,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,071 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:37,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,072 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:37,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:37,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:37,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:37,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:37,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:37,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:37,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:37,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:37,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:37,093 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:44:37,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:44:37,099 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 10:44:37,101 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:44:37,102 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:44:37,102 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:44:37,103 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-11-10 10:44:37,162 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 10:44:37,168 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:44:37,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:37,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:37,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:37,223 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-11-10 10:44:37,228 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-11-10 10:44:37,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:44:37,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:44:37,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:44:37,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-10 10:44:37,340 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-11-10 10:44:37,342 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-11-10 10:44:37,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:44:37,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-10 10:44:37,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:37,470 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-11-10 10:44:37,474 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-11-10 10:44:37,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:37,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:37,515 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-11-10 10:44:37,516 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 10:44:37,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:37,566 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-11-10 10:44:37,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:52 [2018-11-10 10:44:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:37,595 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-11-10 10:44:37,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2 Second operand 12 states. [2018-11-10 10:44:37,985 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-11-10 10:44:37,985 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-11-10 10:44:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 10:44:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 47 transitions. [2018-11-10 10:44:37,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-10 10:44:37,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:37,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 23 letters. Loop has 18 letters. [2018-11-10 10:44:37,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:37,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 5 letters. Loop has 36 letters. [2018-11-10 10:44:37,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:37,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 89 transitions. [2018-11-10 10:44:37,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-10 10:44:37,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 82 states and 87 transitions. [2018-11-10 10:44:37,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 10:44:37,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 10:44:37,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 87 transitions. [2018-11-10 10:44:37,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:44:37,993 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-11-10 10:44:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 87 transitions. [2018-11-10 10:44:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2018-11-10 10:44:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 10:44:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-11-10 10:44:37,997 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-11-10 10:44:37,997 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-11-10 10:44:37,997 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:44:37,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 64 transitions. [2018-11-10 10:44:37,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 10:44:37,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:37,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:37,999 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 10:44:37,999 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-11-10 10:44:37,999 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-11-10 10:44:37,999 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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~mem9;havoc test_fun_#t~mem10; 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-11-10 10:44:37,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash 889444104, now seen corresponding path program 1 times [2018-11-10 10:44:38,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:38,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:38,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:38,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:38,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:38,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1035340172, now seen corresponding path program 1 times [2018-11-10 10:44:38,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:38,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:38,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:38,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1201191603, now seen corresponding path program 1 times [2018-11-10 10:44:38,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:38,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:38,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:38,216 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-10 10:44:38,379 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 10:44:38,456 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:44:38,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:44:38,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:44:38,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:44:38,456 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:44:38,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:44:38,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:44:38,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:44:38,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 10:44:38,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:44:38,457 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:44:38,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,696 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-10 10:44:38,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:38,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:39,078 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:44:39,078 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:44:39,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:39,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:39,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:39,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:39,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:39,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:39,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:39,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:39,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:39,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:39,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:39,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:39,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:39,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:39,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:39,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:39,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:39,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:39,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:39,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:39,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:39,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:39,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:39,097 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:44:39,100 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:44:39,100 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:44:39,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:44:39,101 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:44:39,101 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:44:39,101 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-11-10 10:44:39,147 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 10:44:39,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:44:39,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:39,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:39,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:39,219 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-11-10 10:44:39,222 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-11-10 10:44:39,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 10:44:39,259 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-11-10 10:44:39,262 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-11-10 10:44:39,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-10 10:44:39,347 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-11-10 10:44:39,352 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-11-10 10:44:39,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:39,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:39,379 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-11-10 10:44:39,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:39,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:39,410 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:50, output treesize:60 [2018-11-10 10:44:39,572 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:39,573 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-11-10 10:44:39,577 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:44:39,578 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-11-10 10:44:39,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:39,606 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-11-10 10:44:39,608 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-11-10 10:44:39,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:39,629 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-11-10 10:44:39,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:119, output treesize:73 [2018-11-10 10:44:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:39,665 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-11-10 10:44:39,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 64 transitions. cyclomatic complexity: 7 Second operand 18 states. [2018-11-10 10:44:40,194 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-11-10 10:44:40,195 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-11-10 10:44:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 10:44:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2018-11-10 10:44:40,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 45 transitions. Stem has 6 letters. Loop has 25 letters. [2018-11-10 10:44:40,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:40,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 45 transitions. Stem has 31 letters. Loop has 25 letters. [2018-11-10 10:44:40,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:40,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 45 transitions. Stem has 6 letters. Loop has 50 letters. [2018-11-10 10:44:40,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:40,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 220 transitions. [2018-11-10 10:44:40,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 10:44:40,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 180 states and 192 transitions. [2018-11-10 10:44:40,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 10:44:40,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-10 10:44:40,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 192 transitions. [2018-11-10 10:44:40,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:44:40,202 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-11-10 10:44:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 192 transitions. [2018-11-10 10:44:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2018-11-10 10:44:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 10:44:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-11-10 10:44:40,208 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-10 10:44:40,208 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-10 10:44:40,208 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:44:40,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 161 transitions. [2018-11-10 10:44:40,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 10:44:40,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:40,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:40,211 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-11-10 10:44:40,211 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-11-10 10:44:40,211 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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-11-10 10:44:40,211 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~mem9;havoc test_fun_#t~mem10; 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~mem9;havoc test_fun_#t~mem10; 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~short7;havoc test_fun_#t~mem5; 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-11-10 10:44:40,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1406625840, now seen corresponding path program 1 times [2018-11-10 10:44:40,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:40,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:40,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:40,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:40,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:40,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1191060236, now seen corresponding path program 2 times [2018-11-10 10:44:40,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:40,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:40,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:40,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -963141091, now seen corresponding path program 2 times [2018-11-10 10:44:40,246 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:40,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:40,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:40,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:40,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:40,467 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-11-10 10:44:41,160 WARN L179 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 139 [2018-11-10 10:44:41,355 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-10 10:44:41,358 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:44:41,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:44:41,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:44:41,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:44:41,358 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:44:41,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:44:41,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:44:41,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:44:41,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-10 10:44:41,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:44:41,358 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:44:41,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,618 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-11-10 10:44:41,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,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-11-10 10:44:41,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:41,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:42,089 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:44:42,090 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:44:42,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:42,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:42,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:42,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:42,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:42,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:42,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,134 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:42,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,139 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:42,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,155 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:42,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,156 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:42,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:42,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:42,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:42,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:42,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:42,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:42,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:42,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:42,182 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:44:42,194 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 10:44:42,194 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 10:44:42,195 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:44:42,196 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:44:42,196 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:44:42,196 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-11-10 10:44:42,278 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 10:44:42,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:44:42,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:42,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:42,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:42,388 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-11-10 10:44:42,392 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-11-10 10:44:42,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:42,423 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:42,425 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-11-10 10:44:42,426 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:42,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:42,453 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-11-10 10:44:42,573 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:42,575 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-11-10 10:44:42,576 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-11-10 10:44:42,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:42,605 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-11-10 10:44:42,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:44:42,608 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-11-10 10:44:42,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:42,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:50 [2018-11-10 10:44:42,724 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-11-10 10:44:42,727 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-11-10 10:44:42,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:42,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:42,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:42,753 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-11-10 10:44:42,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,769 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:28 [2018-11-10 10:44:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:42,783 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-11-10 10:44:42,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 18 states. [2018-11-10 10:44:43,070 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-11-10 10:44:43,070 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-11-10 10:44:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 10:44:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2018-11-10 10:44:43,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 23 letters. Loop has 25 letters. [2018-11-10 10:44:43,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:43,071 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:44:43,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:43,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:43,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:43,145 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-11-10 10:44:43,148 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-11-10 10:44:43,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:43,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:43,172 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-11-10 10:44:43,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:43,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:43,200 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-11-10 10:44:43,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:43,299 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-11-10 10:44:43,301 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:44:43,302 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-11-10 10:44:43,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:43,336 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-11-10 10:44:43,338 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-11-10 10:44:43,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:43,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:50 [2018-11-10 10:44:43,456 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-11-10 10:44:43,459 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-11-10 10:44:43,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:43,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:43,488 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:43,489 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-11-10 10:44:43,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:43,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:43,514 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:28 [2018-11-10 10:44:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:43,528 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-11-10 10:44:43,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 18 states. [2018-11-10 10:44:43,859 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-11-10 10:44:43,860 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-11-10 10:44:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 10:44:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2018-11-10 10:44:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 55 transitions. Stem has 23 letters. Loop has 25 letters. [2018-11-10 10:44:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 55 transitions. Stem has 48 letters. Loop has 25 letters. [2018-11-10 10:44:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 55 transitions. Stem has 23 letters. Loop has 50 letters. [2018-11-10 10:44:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:43,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 432 transitions. [2018-11-10 10:44:43,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 10:44:43,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 354 states and 375 transitions. [2018-11-10 10:44:43,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2018-11-10 10:44:43,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-11-10 10:44:43,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 375 transitions. [2018-11-10 10:44:43,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:44:43,869 INFO L705 BuchiCegarLoop]: Abstraction has 354 states and 375 transitions. [2018-11-10 10:44:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 375 transitions. [2018-11-10 10:44:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 292. [2018-11-10 10:44:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-10 10:44:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 313 transitions. [2018-11-10 10:44:43,880 INFO L728 BuchiCegarLoop]: Abstraction has 292 states and 313 transitions. [2018-11-10 10:44:43,880 INFO L608 BuchiCegarLoop]: Abstraction has 292 states and 313 transitions. [2018-11-10 10:44:43,880 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:44:43,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 313 transitions. [2018-11-10 10:44:43,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 10:44:43,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:43,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:43,882 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-11-10 10:44:43,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:43,883 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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-11-10 10:44:43,883 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~mem9;havoc test_fun_#t~mem10; 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-11-10 10:44:43,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash -655728047, now seen corresponding path program 2 times [2018-11-10 10:44:43,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:43,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:43,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash -484491459, now seen corresponding path program 1 times [2018-11-10 10:44:43,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:43,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:43,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:43,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:43,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:43,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1199529235, now seen corresponding path program 3 times [2018-11-10 10:44:43,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:43,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:43,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:43,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:43,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:44,549 WARN L179 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2018-11-10 10:44:44,672 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-10 10:44:44,673 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:44:44,674 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:44:44,674 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:44:44,674 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:44:44,674 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:44:44,674 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:44:44,674 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:44:44,674 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:44:44,674 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 10:44:44,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:44:44,674 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:44:44,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-11-10 10:44:44,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-11-10 10:44:44,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,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-11-10 10:44:44,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-11-10 10:44:44,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-11-10 10:44:44,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-11-10 10:44:44,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-11-10 10:44:44,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,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-11-10 10:44:44,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,918 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2018-11-10 10:44:44,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:44,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:45,261 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:44:45,262 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:44:45,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:45,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:45,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:45,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,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-11-10 10:44:45,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:45,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:45,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:45,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:45,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:45,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:45,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:45,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:45,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:45,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,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-11-10 10:44:45,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:45,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:45,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:45,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:45,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:45,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:45,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:45,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:45,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:45,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,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-11-10 10:44:45,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:45,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:45,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:45,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,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-11-10 10:44:45,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,291 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:45,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,291 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:45,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,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-11-10 10:44:45,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,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-11-10 10:44:45,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,306 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:45,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,307 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:45,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:45,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:45,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:45,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:45,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:45,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:45,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:45,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:45,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:44:45,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:44:45,329 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:44:45,329 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:44:45,330 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:44:45,330 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:44:45,330 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-11-10 10:44:45,417 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 10:44:45,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:44:45,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:44:45,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:45,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:45,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:45,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:45,480 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-11-10 10:44:45,483 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-11-10 10:44:45,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:45,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:45,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:45,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:45,503 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-11-10 10:44:45,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:45,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:45,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:45,527 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 10:44:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:45,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 10:44:45,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 292 states and 313 transitions. cyclomatic complexity: 29 Second operand 7 states. [2018-11-10 10:44:45,565 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-11-10 10:44:45,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 10:44:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:44:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-10 10:44:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-10 10:44:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 31 letters. Loop has 7 letters. [2018-11-10 10:44:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 24 letters. Loop has 14 letters. [2018-11-10 10:44:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:45,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 455 transitions. [2018-11-10 10:44:45,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 10:44:45,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 372 states and 394 transitions. [2018-11-10 10:44:45,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-10 10:44:45,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-10 10:44:45,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 394 transitions. [2018-11-10 10:44:45,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:44:45,570 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 394 transitions. [2018-11-10 10:44:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 394 transitions. [2018-11-10 10:44:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2018-11-10 10:44:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-10 10:44:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 336 transitions. [2018-11-10 10:44:45,578 INFO L728 BuchiCegarLoop]: Abstraction has 314 states and 336 transitions. [2018-11-10 10:44:45,578 INFO L608 BuchiCegarLoop]: Abstraction has 314 states and 336 transitions. [2018-11-10 10:44:45,579 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:44:45,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 336 transitions. [2018-11-10 10:44:45,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 10:44:45,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:45,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:45,581 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-11-10 10:44:45,581 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-11-10 10:44:45,581 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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~mem9;havoc test_fun_#t~mem10; 3349#L558-5 [2018-11-10 10:44:45,581 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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~mem9;havoc test_fun_#t~mem10; 3349#L558-5 [2018-11-10 10:44:45,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1309614612, now seen corresponding path program 3 times [2018-11-10 10:44:45,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:45,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:45,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:45,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:45,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:44:45,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:45,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:44:45,703 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:44:45,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1415115844, now seen corresponding path program 3 times [2018-11-10 10:44:45,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:45,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:45,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:45,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:45,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:45,870 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-10 10:44:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:44:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:45,890 INFO L87 Difference]: Start difference. First operand 314 states and 336 transitions. cyclomatic complexity: 32 Second operand 10 states. [2018-11-10 10:44:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:45,975 INFO L93 Difference]: Finished difference Result 303 states and 317 transitions. [2018-11-10 10:44:45,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:44:45,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 317 transitions. [2018-11-10 10:44:45,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2018-11-10 10:44:45,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 147 states and 153 transitions. [2018-11-10 10:44:45,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-10 10:44:45,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-10 10:44:45,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 153 transitions. [2018-11-10 10:44:45,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:44:45,982 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-11-10 10:44:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 153 transitions. [2018-11-10 10:44:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-11-10 10:44:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-10 10:44:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-11-10 10:44:45,985 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-11-10 10:44:45,985 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-11-10 10:44:45,985 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:44:45,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 140 transitions. [2018-11-10 10:44:45,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 10:44:45,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:45,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:45,989 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-11-10 10:44:45,990 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-11-10 10:44:45,990 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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~mem9;havoc test_fun_#t~mem10; 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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-11-10 10:44:45,990 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~mem9;havoc test_fun_#t~mem10; 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~mem9;havoc test_fun_#t~mem10; 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~short7;havoc test_fun_#t~mem5; 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-11-10 10:44:45,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1516184533, now seen corresponding path program 4 times [2018-11-10 10:44:45,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:45,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:45,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:45,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:45,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:46,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:46,218 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57b316ff-95d1-49a0-ad0c-9d98dffbdd85/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:44:46,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:44:46,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:44:46,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:44:46,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:46,282 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-11-10 10:44:46,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 10:44:46,300 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-11-10 10:44:46,306 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-11-10 10:44:46,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-10 10:44:46,336 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-11-10 10:44:46,339 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-11-10 10:44:46,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-11-10 10:44:46,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:46,431 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-11-10 10:44:46,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 33 treesize of output 26 [2018-11-10 10:44:46,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2018-11-10 10:44:46,493 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-11-10 10:44:46,495 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-11-10 10:44:46,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:25 [2018-11-10 10:44:46,531 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-11-10 10:44:46,533 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-11-10 10:44:46,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-10 10:44:46,563 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-11-10 10:44:46,565 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-11-10 10:44:46,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,574 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-11-10 10:44:46,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-11-10 10:44:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:46,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:44:46,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 29 [2018-11-10 10:44:46,625 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:44:46,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1191060236, now seen corresponding path program 4 times [2018-11-10 10:44:46,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:46,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:46,805 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-11-10 10:44:46,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 10:44:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:44:46,831 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. cyclomatic complexity: 11 Second operand 29 states. [2018-11-10 10:44:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:47,115 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-11-10 10:44:47,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 10:44:47,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 170 transitions. [2018-11-10 10:44:47,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:44:47,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 93 states and 96 transitions. [2018-11-10 10:44:47,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 10:44:47,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-10 10:44:47,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 96 transitions. [2018-11-10 10:44:47,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:44:47,117 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-11-10 10:44:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 96 transitions. [2018-11-10 10:44:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2018-11-10 10:44:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 10:44:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-10 10:44:47,119 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-10 10:44:47,119 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-10 10:44:47,119 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 10:44:47,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 76 transitions. [2018-11-10 10:44:47,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:44:47,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:44:47,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:44:47,121 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-11-10 10:44:47,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:47,121 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~short7;havoc test_fun_#t~mem5; 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~mem9;havoc test_fun_#t~mem10; 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~mem9;havoc test_fun_#t~mem10; 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~mem9;havoc test_fun_#t~mem10; 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~short7;havoc test_fun_#t~mem5; 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-11-10 10:44:47,121 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~mem9;havoc test_fun_#t~mem10; 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-11-10 10:44:47,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash 207397284, now seen corresponding path program 5 times [2018-11-10 10:44:47,121 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:47,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:47,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:47,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:47,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:47,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash -484491459, now seen corresponding path program 2 times [2018-11-10 10:44:47,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:47,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:47,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:47,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:47,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:47,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash 953880634, now seen corresponding path program 6 times [2018-11-10 10:44:47,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:47,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:47,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:47,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:47,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:44:50,333 WARN L179 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2018-11-10 10:44:50,811 WARN L179 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-10 10:44:50,813 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:44:50,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:44:50,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:44:50,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:44:50,814 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:44:50,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:44:50,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:44:50,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:44:50,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.02-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-10 10:44:50,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:44:50,814 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:44:50,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-11-10 10:44:50,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:50,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,162 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 103 [2018-11-10 10:44:51,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,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-11-10 10:44:51,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:44:51,649 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:44:51,649 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:44:51,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:44:51,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:44:51,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:44:51,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,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-11-10 10:44:51,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,654 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:51,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,654 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:51,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,657 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,657 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:51,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,658 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:51,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,685 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:44:51,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,686 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:44:51,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:44:51,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:44:51,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:44:51,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:44:51,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:44:51,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:44:51,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:44:51,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:44:51,710 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:44:51,714 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:44:51,714 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:44:51,714 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:44:51,715 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:44:51,715 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:44:51,715 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)_5, 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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 Supporting invariants [] [2018-11-10 10:44:51,840 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 10:44:51,842 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:44:51,842 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:44:51,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:51,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:51,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:51,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:51,977 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-11-10 10:44:51,981 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-11-10 10:44:51,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:52,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,026 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-11-10 10:44:52,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:52,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:52,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:52,072 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 10:44:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:52,109 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 10:44:52,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 10:44:52,163 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-11-10 10:44:52,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 10:44:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:44:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-10 10:44:52,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 49 letters. Loop has 7 letters. [2018-11-10 10:44:52,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:52,165 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:44:52,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:52,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:52,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:52,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,269 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-11-10 10:44:52,273 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-11-10 10:44:52,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:52,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,294 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-11-10 10:44:52,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:52,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:52,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:52,320 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 10:44:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:52,337 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 10:44:52,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 10:44:52,380 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-11-10 10:44:52,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 10:44:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:44:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-10 10:44:52,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 49 letters. Loop has 7 letters. [2018-11-10 10:44:52,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:52,380 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:44:52,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:52,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:52,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:52,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,502 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-11-10 10:44:52,508 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-11-10 10:44:52,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:52,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:52,529 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-11-10 10:44:52,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:52,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:52,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:44:52,556 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 10:44:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:52,572 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 10:44:52,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 10:44:52,595 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-11-10 10:44:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 10:44:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:44:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-10 10:44:52,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 49 letters. Loop has 7 letters. [2018-11-10 10:44:52,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:52,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 56 letters. Loop has 7 letters. [2018-11-10 10:44:52,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:52,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 49 letters. Loop has 14 letters. [2018-11-10 10:44:52,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:44:52,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 118 transitions. [2018-11-10 10:44:52,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:44:52,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 0 states and 0 transitions. [2018-11-10 10:44:52,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:44:52,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:44:52,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:44:52,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:44:52,600 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:44:52,600 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:44:52,600 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:44:52,600 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 10:44:52,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:44:52,600 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:44:52,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:44:52,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:44:52 BoogieIcfgContainer [2018-11-10 10:44:52,607 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:44:52,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:44:52,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:44:52,611 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:44:52,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:44:35" (3/4) ... [2018-11-10 10:44:52,617 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:44:52,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:44:52,619 INFO L168 Benchmark]: Toolchain (without parser) took 18009.67 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 466.6 MB). Free memory was 952.2 MB in the beginning and 1.4 GB in the end (delta: -462.5 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:44:52,619 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:44:52,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.49 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 929.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:44:52,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:44:52,620 INFO L168 Benchmark]: Boogie Preprocessor took 15.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:44:52,620 INFO L168 Benchmark]: RCFGBuilder took 279.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:44:52,620 INFO L168 Benchmark]: BuchiAutomizer took 17362.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -294.5 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:44:52,620 INFO L168 Benchmark]: Witness Printer took 6.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:44:52,622 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.49 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 929.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 279.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17362.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -294.5 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_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 17.3s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 12.3s. Construction of modules took 0.6s. Büchi inclusion checks took 4.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, 0.6s 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: 18ms 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...