./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.01-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_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/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 f5878942b695ddbfe46daa43f5d95028455ef120 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:57,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:57,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:57,940 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:57,941 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:57,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:57,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:57,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:57,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:57,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:57,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:57,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:57,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:57,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:57,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:57,949 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:57,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:57,952 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:57,953 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:57,955 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:57,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:57,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:57,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:57,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:57,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:57,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:57,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:57,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:57,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:57,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:57,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:57,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:57,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:57,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:57,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:57,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:57,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:07:57,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:57,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:57,979 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:57,979 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:57,979 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:57,980 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:57,980 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:57,980 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:57,980 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:57,980 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:57,981 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:57,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:57,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:57,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:57,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:57,981 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:57,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:57,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:57,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:57,983 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:57,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:57,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:57,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:57,984 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:57,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:57,984 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:57,984 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:57,985 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:57,985 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_6ab25b2b-9b6f-419b-93d0-429ce7106949/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 -> f5878942b695ddbfe46daa43f5d95028455ef120 [2018-10-27 06:07:58,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:58,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:58,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:58,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:58,025 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:58,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:07:58,079 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/data/b0018fc28/cc15f75fd7364f2eb60abd124006a88b/FLAG7d0625044 [2018-10-27 06:07:58,511 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:58,512 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:07:58,521 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/data/b0018fc28/cc15f75fd7364f2eb60abd124006a88b/FLAG7d0625044 [2018-10-27 06:07:58,531 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/data/b0018fc28/cc15f75fd7364f2eb60abd124006a88b [2018-10-27 06:07:58,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:58,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:58,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:58,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:58,540 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:58,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:58,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@250c3e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58, skipping insertion in model container [2018-10-27 06:07:58,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:58,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:58,586 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:58,857 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:58,866 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:58,911 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:58,948 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:58,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58 WrapperNode [2018-10-27 06:07:58,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:58,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:58,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:58,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:58,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:58,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:58,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:58,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:58,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:58,986 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:59,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:59,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:59,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:59,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:59,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:59,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:59,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... [2018-10-27 06:07:59,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:59,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:59,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:59,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:59,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:07:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:07:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:59,472 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:59,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:59 BoogieIcfgContainer [2018-10-27 06:07:59,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:59,474 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:59,474 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:59,477 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:59,477 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:59,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:58" (1/3) ... [2018-10-27 06:07:59,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ef1fc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:59, skipping insertion in model container [2018-10-27 06:07:59,480 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:59,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:58" (2/3) ... [2018-10-27 06:07:59,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ef1fc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:59, skipping insertion in model container [2018-10-27 06:07:59,480 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:59,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:59" (3/3) ... [2018-10-27 06:07:59,482 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.01-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:07:59,532 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:59,533 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:59,533 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:59,533 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:59,533 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:59,533 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:59,533 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:59,533 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:59,534 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:59,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:07:59,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:07:59,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:59,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:59,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:59,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:59,574 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:59,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:07:59,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:07:59,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:59,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:59,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:59,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:59,585 INFO L793 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;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~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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; 9#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 10#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 18#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 21#L555-3true [2018-10-27 06:07:59,586 INFO L795 eck$LassoCheckResult]: Loop: 21#L555-3true assume true; 5#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 7#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 15#L556true SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 19#L557-4true assume !true; 22#L557-5true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 26#L560true SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 27#L560-1true havoc test_fun_#t~mem9; 21#L555-3true [2018-10-27 06:07:59,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-10-27 06:07:59,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:59,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:59,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:59,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1654609785, now seen corresponding path program 1 times [2018-10-27 06:07:59,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:59,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:59,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:59,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:59,768 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:07:59,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:07:59,781 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-10-27 06:07:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:59,786 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-10-27 06:07:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:07:59,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-10-27 06:07:59,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:07:59,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 19 states and 20 transitions. [2018-10-27 06:07:59,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-10-27 06:07:59,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:07:59,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-10-27 06:07:59,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:59,795 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-27 06:07:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-10-27 06:07:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-27 06:07:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-27 06:07:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-27 06:07:59,820 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-27 06:07:59,820 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-27 06:07:59,820 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:59,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-10-27 06:07:59,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:07:59,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:59,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:59,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:59,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:59,822 INFO L793 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 69#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;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~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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; 70#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 74#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 71#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 72#L555-3 [2018-10-27 06:07:59,822 INFO L795 eck$LassoCheckResult]: Loop: 72#L555-3 assume true; 66#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 67#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 63#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 64#L557-4 assume true; 60#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 61#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 65#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 68#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 75#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 76#L560-1 havoc test_fun_#t~mem9; 72#L555-3 [2018-10-27 06:07:59,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-10-27 06:07:59,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:59,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:59,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:59,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:59,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:59,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1822428636, now seen corresponding path program 1 times [2018-10-27 06:07:59,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:59,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:59,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:59,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:59,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -278082372, now seen corresponding path program 1 times [2018-10-27 06:07:59,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:59,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:59,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:59,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:00,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:00,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:08:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:08:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:08:00,435 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-10-27 06:08:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:00,679 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-10-27 06:08:00,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:08:00,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-10-27 06:08:00,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:08:00,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2018-10-27 06:08:00,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-10-27 06:08:00,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-10-27 06:08:00,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-10-27 06:08:00,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:00,682 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-10-27 06:08:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-10-27 06:08:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-10-27 06:08:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:08:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-27 06:08:00,684 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-27 06:08:00,684 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-27 06:08:00,684 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:00,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-10-27 06:08:00,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:00,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:00,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:00,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:00,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:00,686 INFO L793 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;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~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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; 132#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 136#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 133#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 134#L555-3 [2018-10-27 06:08:00,686 INFO L795 eck$LassoCheckResult]: Loop: 134#L555-3 assume true; 128#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 129#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 124#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 125#L557-4 assume true; 141#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 140#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 130#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 119#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 120#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 123#L558-2 havoc test_fun_#t~mem8; 127#L557-4 assume true; 121#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 122#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 126#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 137#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 138#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 139#L560-1 havoc test_fun_#t~mem9; 134#L555-3 [2018-10-27 06:08:00,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 3 times [2018-10-27 06:08:00,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash -623226196, now seen corresponding path program 1 times [2018-10-27 06:08:00,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash -555542580, now seen corresponding path program 1 times [2018-10-27 06:08:00,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,144 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-10-27 06:08:01,256 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-27 06:08:01,498 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-10-27 06:08:01,734 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-27 06:08:01,753 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:01,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:01,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:01,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:01,755 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:01,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:01,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:01,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:01,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-10-27 06:08:01,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:01,758 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:01,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,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-10-27 06:08:01,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,259 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2018-10-27 06:08:02,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,042 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:03,046 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:03,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:03,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:03,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:03,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:03,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:03,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:03,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,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-10-27 06:08:03,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:03,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:03,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:03,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:03,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:03,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:03,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,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-10-27 06:08:03,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,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-10-27 06:08:03,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:03,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:03,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:03,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,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-10-27 06:08:03,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:03,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:03,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:03,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,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-10-27 06:08:03,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,117 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:03,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,119 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:03,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,125 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:03,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:03,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,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-10-27 06:08:03,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,140 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:03,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,141 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:03,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:03,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:03,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:03,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:03,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:03,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:03,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:03,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:03,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:03,170 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:03,170 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:08:03,172 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:03,173 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:03,173 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:03,174 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-10-27 06:08:03,289 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-10-27 06:08:03,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:03,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:03,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:03,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:03,438 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 26 treesize of output 36 [2018-10-27 06:08:03,444 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 27 treesize of output 26 [2018-10-27 06:08:03,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:03,501 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 2 case distinctions, treesize of input 22 treesize of output 32 [2018-10-27 06:08:03,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:03,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:03,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:03,527 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:40 [2018-10-27 06:08:03,579 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 37 treesize of output 30 [2018-10-27 06:08:03,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:03,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,628 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 42 treesize of output 48 [2018-10-27 06:08:03,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:03,639 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:03,641 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 34 treesize of output 42 [2018-10-27 06:08:03,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,675 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 39 treesize of output 31 [2018-10-27 06:08:03,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:03,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:08:03,720 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:80, output treesize:73 [2018-10-27 06:08:04,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:04,144 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 29 [2018-10-27 06:08:04,147 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 29 treesize of output 22 [2018-10-27 06:08:04,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:04,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:04,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:04,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-10-27 06:08:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:04,173 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-10-27 06:08:04,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 13 states. [2018-10-27 06:08:04,938 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 24 transitions. cyclomatic complexity: 2. Second operand 13 states. Result 64 states and 67 transitions. Complement of second has 27 states. [2018-10-27 06:08:04,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-27 06:08:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-10-27 06:08:04,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 26 transitions. Stem has 5 letters. Loop has 18 letters. [2018-10-27 06:08:04,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 26 transitions. Stem has 23 letters. Loop has 18 letters. [2018-10-27 06:08:04,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 26 transitions. Stem has 5 letters. Loop has 36 letters. [2018-10-27 06:08:04,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 67 transitions. [2018-10-27 06:08:04,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:04,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 60 states and 63 transitions. [2018-10-27 06:08:04,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-10-27 06:08:04,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-10-27 06:08:04,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 63 transitions. [2018-10-27 06:08:04,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:04,948 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-10-27 06:08:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 63 transitions. [2018-10-27 06:08:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-10-27 06:08:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 06:08:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-10-27 06:08:04,951 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-27 06:08:04,951 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-27 06:08:04,951 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:04,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 56 transitions. [2018-10-27 06:08:04,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:04,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:04,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:04,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:04,953 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:04,953 INFO L793 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 448#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;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~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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; 449#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 458#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 450#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 451#L555-3 assume true; 443#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 444#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 447#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 474#L557-4 assume true; 473#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 472#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 471#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 470#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 428#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 429#L558-2 havoc test_fun_#t~mem8; 435#L557-4 [2018-10-27 06:08:04,953 INFO L795 eck$LassoCheckResult]: Loop: 435#L557-4 assume true; 431#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 432#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 437#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 424#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 425#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 469#L558-2 havoc test_fun_#t~mem8; 468#L557-4 assume true; 467#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 466#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 465#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 453#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 454#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 459#L560-1 havoc test_fun_#t~mem9; 461#L555-3 assume true; 476#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 475#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 439#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 435#L557-4 [2018-10-27 06:08:04,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,953 INFO L82 PathProgramCache]: Analyzing trace with hash -278028748, now seen corresponding path program 1 times [2018-10-27 06:08:04,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2036193300, now seen corresponding path program 2 times [2018-10-27 06:08:04,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1981136735, now seen corresponding path program 2 times [2018-10-27 06:08:04,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,530 WARN L179 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 123 [2018-10-27 06:08:05,662 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-27 06:08:05,664 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:05,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:05,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:05,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:05,664 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:05,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:05,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:05,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:05,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-10-27 06:08:05,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:05,665 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:05,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:05,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:05,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,021 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2018-10-27 06:08:06,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:06,589 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:06,589 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:06,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:06,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:06,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:06,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,618 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:06,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,620 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:06,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,642 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:06,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,647 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:06,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,701 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:06,718 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-10-27 06:08:06,720 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:08:06,720 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:06,723 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:06,724 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:06,724 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-10-27 06:08:06,996 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-10-27 06:08:06,997 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:07,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:07,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:07,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:07,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-10-27 06:08:07,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-10-27 06:08:07,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,218 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:07,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:07,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-10-27 06:08:07,223 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:07,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:07,263 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-10-27 06:08:07,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:07,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-10-27 06:08:07,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-10-27 06:08:07,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:07,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-10-27 06:08:07,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:07,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-10-27 06:08:07,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:07,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:50 [2018-10-27 06:08:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:07,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-10-27 06:08:07,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-10-27 06:08:07,964 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-10-27 06:08:08,196 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5. Second operand 15 states. Result 119 states and 124 transitions. Complement of second has 27 states. [2018-10-27 06:08:08,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-27 06:08:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2018-10-27 06:08:08,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 36 transitions. Stem has 16 letters. Loop has 18 letters. [2018-10-27 06:08:08,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:08,197 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:08,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:08,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:08,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:08,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-10-27 06:08:08,410 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:08,411 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:08,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-10-27 06:08:08,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:08,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-10-27 06:08:08,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:08,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:08,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:08,468 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-10-27 06:08:08,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:08,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-10-27 06:08:08,582 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:08,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-10-27 06:08:08,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:08,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:08,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:08,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-10-27 06:08:08,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-10-27 06:08:08,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:08,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:08,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:08,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:50 [2018-10-27 06:08:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:08,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2018-10-27 06:08:08,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-10-27 06:08:09,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5. Second operand 15 states. Result 120 states and 126 transitions. Complement of second has 29 states. [2018-10-27 06:08:09,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-27 06:08:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2018-10-27 06:08:09,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 16 letters. Loop has 18 letters. [2018-10-27 06:08:09,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 34 letters. Loop has 18 letters. [2018-10-27 06:08:09,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 16 letters. Loop has 36 letters. [2018-10-27 06:08:09,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 126 transitions. [2018-10-27 06:08:09,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-10-27 06:08:09,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 108 states and 114 transitions. [2018-10-27 06:08:09,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-10-27 06:08:09,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-10-27 06:08:09,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 114 transitions. [2018-10-27 06:08:09,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:09,200 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-10-27 06:08:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 114 transitions. [2018-10-27 06:08:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-10-27 06:08:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-27 06:08:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-10-27 06:08:09,209 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-10-27 06:08:09,209 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-10-27 06:08:09,209 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:09,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 95 transitions. [2018-10-27 06:08:09,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-10-27 06:08:09,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:09,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:09,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:09,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:09,213 INFO L793 eck$LassoCheckResult]: Stem: 1163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;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~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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; 1160#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1170#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 1161#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1162#L555-3 assume true; 1153#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 1154#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1149#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1150#L557-4 assume true; 1219#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1218#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1217#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1134#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1135#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1214#L558-2 havoc test_fun_#t~mem8; 1212#L557-4 assume true; 1141#L557 [2018-10-27 06:08:09,213 INFO L795 eck$LassoCheckResult]: Loop: 1141#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1142#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1147#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1157#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1138#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1139#L558-2 havoc test_fun_#t~mem8; 1145#L557-4 assume true; 1141#L557 [2018-10-27 06:08:09,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,213 INFO L82 PathProgramCache]: Analyzing trace with hash -28956575, now seen corresponding path program 2 times [2018-10-27 06:08:09,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1395364785, now seen corresponding path program 1 times [2018-10-27 06:08:09,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,247 INFO L82 PathProgramCache]: Analyzing trace with hash -40288431, now seen corresponding path program 3 times [2018-10-27 06:08:09,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:09,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,594 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:08:09,769 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 06:08:10,101 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 123 [2018-10-27 06:08:10,232 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-27 06:08:10,234 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:10,234 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:10,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:10,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:10,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:10,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:10,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:10,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:10,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-10-27 06:08:10,234 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:10,234 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:10,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,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-10-27 06:08:10,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,544 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-10-27 06:08:10,671 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-10-27 06:08:10,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,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-10-27 06:08:10,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:11,074 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:11,074 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:11,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:11,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:11,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:11,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,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-10-27 06:08:11,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:11,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:11,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:11,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:11,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:11,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:11,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:11,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:11,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:11,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:11,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:11,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:11,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,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-10-27 06:08:11,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,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-10-27 06:08:11,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,159 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:11,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:11,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,197 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:11,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,198 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:11,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:11,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:11,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:11,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:11,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:11,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:11,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:11,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:11,218 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:11,224 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:11,225 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:11,225 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:11,225 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:11,226 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:11,226 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3, 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-10-27 06:08:11,711 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-10-27 06:08:11,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:11,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:11,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:11,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:11,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:11,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-10-27 06:08:11,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-10-27 06:08:11,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,877 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-10-27 06:08:11,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:11,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:11,906 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-10-27 06:08:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:11,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:11,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 95 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-10-27 06:08:11,985 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 95 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 156 states and 165 transitions. Complement of second has 13 states. [2018-10-27 06:08:11,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-10-27 06:08:11,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 17 letters. Loop has 7 letters. [2018-10-27 06:08:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 24 letters. Loop has 7 letters. [2018-10-27 06:08:11,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:11,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 17 letters. Loop has 14 letters. [2018-10-27 06:08:11,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:11,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 165 transitions. [2018-10-27 06:08:11,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-10-27 06:08:11,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 121 states and 127 transitions. [2018-10-27 06:08:11,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-10-27 06:08:11,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-10-27 06:08:11,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 127 transitions. [2018-10-27 06:08:11,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:11,993 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-10-27 06:08:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 127 transitions. [2018-10-27 06:08:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2018-10-27 06:08:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-27 06:08:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-10-27 06:08:12,000 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-10-27 06:08:12,000 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-10-27 06:08:12,000 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:12,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 105 transitions. [2018-10-27 06:08:12,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-10-27 06:08:12,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:12,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:12,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:12,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:12,005 INFO L793 eck$LassoCheckResult]: Stem: 1608#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1604#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;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~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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; 1605#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1614#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 1606#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1607#L555-3 assume true; 1602#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 1603#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1598#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1599#L557-4 assume true; 1586#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1587#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1592#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1582#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1583#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1589#L558-2 havoc test_fun_#t~mem8; 1665#L557-4 assume true; 1662#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1659#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1656#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1646#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 1643#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1640#L560-1 havoc test_fun_#t~mem9; 1641#L555-3 assume true; 1645#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 1644#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1642#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1639#L557-4 assume true; 1638#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1637#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1636#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1634#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1632#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1630#L558-2 havoc test_fun_#t~mem8; 1629#L557-4 [2018-10-27 06:08:12,005 INFO L795 eck$LassoCheckResult]: Loop: 1629#L557-4 assume true; 1628#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1627#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1626#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1620#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1625#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1624#L558-2 havoc test_fun_#t~mem8; 1623#L557-4 assume true; 1622#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1621#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1619#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1609#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 1610#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1615#L560-1 havoc test_fun_#t~mem9; 1617#L555-3 assume true; 1635#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 1633#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1631#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1629#L557-4 [2018-10-27 06:08:12,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2120774999, now seen corresponding path program 3 times [2018-10-27 06:08:12,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:12,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:12,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:12,159 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ab25b2b-9b6f-419b-93d0-429ce7106949/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-10-27 06:08:12,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:12,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 06:08:12,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:12,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:12,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:12,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:12,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:12,330 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 28 treesize of output 21 [2018-10-27 06:08:12,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:12,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2018-10-27 06:08:12,419 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:12,420 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 29 [2018-10-27 06:08:12,422 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 29 treesize of output 22 [2018-10-27 06:08:12,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2018-10-27 06:08:12,455 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 15 treesize of output 11 [2018-10-27 06:08:12,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:12,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 06:08:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:12,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:12,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2018-10-27 06:08:12,479 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:12,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2036193300, now seen corresponding path program 3 times [2018-10-27 06:08:12,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,659 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 06:08:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 06:08:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-10-27 06:08:12,682 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. cyclomatic complexity: 11 Second operand 17 states. [2018-10-27 06:08:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:12,978 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-10-27 06:08:12,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 06:08:12,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 111 transitions. [2018-10-27 06:08:12,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:12,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 79 states and 82 transitions. [2018-10-27 06:08:12,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-10-27 06:08:12,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-10-27 06:08:12,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 82 transitions. [2018-10-27 06:08:12,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:12,984 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-10-27 06:08:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 82 transitions. [2018-10-27 06:08:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-10-27 06:08:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 06:08:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-10-27 06:08:12,987 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-10-27 06:08:12,987 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-10-27 06:08:12,987 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:12,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 62 transitions. [2018-10-27 06:08:12,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:12,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:12,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:12,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:12,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:12,994 INFO L793 eck$LassoCheckResult]: Stem: 1953#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1949#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;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~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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; 1950#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1954#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 1951#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1952#L555-3 assume true; 1945#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 1946#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1936#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1937#L557-4 assume true; 1932#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1933#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1970#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1971#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1930#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1931#L558-2 havoc test_fun_#t~mem8; 1944#L557-4 assume true; 1934#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1935#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1942#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1927#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1928#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1965#L558-2 havoc test_fun_#t~mem8; 1974#L557-4 assume true; 1980#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1979#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1959#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1956#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 1957#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1958#L560-1 havoc test_fun_#t~mem9; 1955#L555-3 assume true; 1947#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 1948#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1938#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1939#L557-4 assume true; 1966#L557 [2018-10-27 06:08:12,994 INFO L795 eck$LassoCheckResult]: Loop: 1966#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1940#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1941#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1925#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1926#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1929#L558-2 havoc test_fun_#t~mem8; 1943#L557-4 assume true; 1966#L557 [2018-10-27 06:08:12,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1285696662, now seen corresponding path program 4 times [2018-10-27 06:08:12,995 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:13,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1395364785, now seen corresponding path program 2 times [2018-10-27 06:08:13,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:13,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:13,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:13,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:13,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:13,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash 370083196, now seen corresponding path program 5 times [2018-10-27 06:08:13,031 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:13,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:13,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:13,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:13,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:13,234 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:08:14,287 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 180 DAG size of output: 159 [2018-10-27 06:08:14,453 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-10-27 06:08:14,455 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:14,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:14,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:14,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:14,456 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:14,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:14,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:14,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:14,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-10-27 06:08:14,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:14,456 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:14,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-10-27 06:08:14,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,749 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2018-10-27 06:08:14,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,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-10-27 06:08:15,184 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:15,184 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:15,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:15,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:15,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:15,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:15,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:15,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:15,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:15,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:15,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:15,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:15,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:15,251 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:15,258 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:08:15,258 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:08:15,258 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:15,259 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:15,259 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:15,259 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 Supporting invariants [] [2018-10-27 06:08:15,408 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-10-27 06:08:15,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:15,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:15,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:15,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:15,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:15,485 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-10-27 06:08:15,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,498 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,500 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 45 treesize of output 52 [2018-10-27 06:08:15,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,535 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-10-27 06:08:15,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:15,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:15,567 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-10-27 06:08:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:15,587 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:15,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-10-27 06:08:15,641 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 77 states and 81 transitions. Complement of second has 13 states. [2018-10-27 06:08:15,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-10-27 06:08:15,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:08:15,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:15,643 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:15,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:15,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:15,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:15,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-10-27 06:08:15,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,815 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,816 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 45 treesize of output 52 [2018-10-27 06:08:15,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-10-27 06:08:15,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:15,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:15,879 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-10-27 06:08:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:15,898 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:15,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-10-27 06:08:16,017 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 77 states and 81 transitions. Complement of second has 15 states. [2018-10-27 06:08:16,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-10-27 06:08:16,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:08:16,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:16,019 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:16,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:16,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-10-27 06:08:16,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-10-27 06:08:16,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,167 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-10-27 06:08:16,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:16,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-10-27 06:08:16,200 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-10-27 06:08:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:16,220 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:16,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-10-27 06:08:16,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 98 states and 104 transitions. Complement of second has 14 states. [2018-10-27 06:08:16,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-10-27 06:08:16,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:08:16,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:16,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 42 letters. Loop has 7 letters. [2018-10-27 06:08:16,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:16,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 35 letters. Loop has 14 letters. [2018-10-27 06:08:16,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:16,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 104 transitions. [2018-10-27 06:08:16,255 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:16,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 0 states and 0 transitions. [2018-10-27 06:08:16,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:16,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:16,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:16,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:16,256 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:16,256 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:16,256 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:16,256 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:16,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:16,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:16,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:16,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:16 BoogieIcfgContainer [2018-10-27 06:08:16,262 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:16,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:16,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:16,262 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:16,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:59" (3/4) ... [2018-10-27 06:08:16,265 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:16,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:16,266 INFO L168 Benchmark]: Toolchain (without parser) took 17730.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.0 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 119.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,267 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:16,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.88 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 935.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.81 ms. Allocated memory is still 1.0 GB. Free memory was 935.5 MB in the beginning and 932.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,268 INFO L168 Benchmark]: Boogie Preprocessor took 83.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -215.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,268 INFO L168 Benchmark]: RCFGBuilder took 404.14 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,268 INFO L168 Benchmark]: BuchiAutomizer took 16787.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 125.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,269 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:16,271 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.88 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 935.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.81 ms. Allocated memory is still 1.0 GB. Free memory was 935.5 MB in the beginning and 932.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -215.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 404.14 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16787.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 125.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 14 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. 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 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.7s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 11.0s. Construction of modules took 0.9s. Büchi inclusion checks took 4.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 99 states and ocurred in iteration 5. Nontrivial modules had stage [2, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/8 HoareTripleCheckerStatistics: 156 SDtfs, 197 SDslu, 236 SDs, 0 SdLazy, 657 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital635 mio100 ax103 hnf100 lsp94 ukn44 mio100 lsp34 div100 bol100 ite100 ukn100 eq202 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 3 VariablesLoop: 0 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...