./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/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 30ab881e1a71a9d76a9921c34ce47cc9425d2331 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:08:00,966 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:00,968 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:00,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:00,980 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:00,981 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:00,982 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:00,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:00,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:00,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:00,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:00,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:00,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:00,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:00,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:00,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:00,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:00,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:00,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:00,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:00,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:00,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:00,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:00,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:00,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:01,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:01,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:01,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:01,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:01,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:01,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:01,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:01,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:01,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:01,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:01,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:01,007 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:08:01,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:01,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:01,021 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:01,022 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:01,024 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:01,024 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:01,024 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:01,024 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:01,024 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:01,024 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:01,025 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:01,025 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:01,025 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:01,025 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:01,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:01,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:01,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:01,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:01,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:01,026 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:01,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:01,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:01,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:01,026 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:01,026 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:01,027 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:01,027 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:01,027 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:01,028 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_548f8752-fa9c-41ba-874f-f173a4d28e9b/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 -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2018-10-27 06:08:01,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:01,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:01,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:01,076 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:01,077 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:01,080 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-10-27 06:08:01,117 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/data/aa6539103/14b11208772f465ca8e3f0359cecac52/FLAG8cbc1246d [2018-10-27 06:08:01,532 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:01,533 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-10-27 06:08:01,544 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/data/aa6539103/14b11208772f465ca8e3f0359cecac52/FLAG8cbc1246d [2018-10-27 06:08:01,557 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/bin-2019/uautomizer/data/aa6539103/14b11208772f465ca8e3f0359cecac52 [2018-10-27 06:08:01,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:01,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:01,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:01,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:01,568 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:01,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:01,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363511fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01, skipping insertion in model container [2018-10-27 06:08:01,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:01,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:01,614 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:01,826 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:01,835 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:01,878 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:01,926 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:01,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01 WrapperNode [2018-10-27 06:08:01,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:01,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:01,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:01,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:01,937 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:08:01" (1/1) ... [2018-10-27 06:08:01,950 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:08:01" (1/1) ... [2018-10-27 06:08:02,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:02,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:02,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:02,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:02,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:02,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:02,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:02,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:02,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:02,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:02,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (1/1) ... [2018-10-27 06:08:02,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:02,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:02,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:02,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:02,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_548f8752-fa9c-41ba-874f-f173a4d28e9b/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:08:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:02,538 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:02,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:02 BoogieIcfgContainer [2018-10-27 06:08:02,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:02,539 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:02,539 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:02,543 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:02,544 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:02,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:01" (1/3) ... [2018-10-27 06:08:02,545 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56cdf8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:02, skipping insertion in model container [2018-10-27 06:08:02,545 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:02,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:01" (2/3) ... [2018-10-27 06:08:02,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56cdf8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:02, skipping insertion in model container [2018-10-27 06:08:02,546 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:02,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:02" (3/3) ... [2018-10-27 06:08:02,547 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-10-27 06:08:02,607 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:02,608 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:02,609 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:02,609 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:02,609 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:02,609 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:02,609 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:02,609 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:02,609 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:02,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:08:02,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:08:02,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:02,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:02,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:02,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:02,659 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:02,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:08:02,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:08:02,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:02,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:02,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:02,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:02,669 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.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];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 23#L551-2true [2018-10-27 06:08:02,670 INFO L795 eck$LassoCheckResult]: Loop: 23#L551-2true assume true; 24#L550-1true SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 3#L550-2true main_#t~short6 := main_#t~mem4 > 0; 5#L550-3true assume !main_#t~short6; 11#L550-7true assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 18#L551true assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 16#L552true SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 19#L552-1true SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 21#L552-2true havoc main_#t~mem8; 23#L551-2true [2018-10-27 06:08:02,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:08:02,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:02,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:02,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:02,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:02,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:02,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1516971858, now seen corresponding path program 1 times [2018-10-27 06:08:02,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:02,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:02,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:02,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:02,871 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:02,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:02,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:02,875 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:02,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:02,889 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-10-27 06:08:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:02,933 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-10-27 06:08:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:02,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-10-27 06:08:02,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:08:02,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 19 transitions. [2018-10-27 06:08:02,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:08:02,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:08:02,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2018-10-27 06:08:02,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:02,942 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-10-27 06:08:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2018-10-27 06:08:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-27 06:08:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:08:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-10-27 06:08:02,964 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-10-27 06:08:02,964 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-10-27 06:08:02,964 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:02,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-10-27 06:08:02,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:08:02,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:02,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:02,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:02,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:02,966 INFO L793 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.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];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 66#L551-2 [2018-10-27 06:08:02,967 INFO L795 eck$LassoCheckResult]: Loop: 66#L551-2 assume true; 71#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 54#L550-2 main_#t~short6 := main_#t~mem4 > 0; 55#L550-3 assume main_#t~short6; 56#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 57#L550-5 main_#t~short6 := main_#t~mem5 > 0; 58#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 64#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 68#L552 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 69#L552-1 SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 70#L552-2 havoc main_#t~mem8; 66#L551-2 [2018-10-27 06:08:02,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:08:02,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:02,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:02,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:02,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 86377137, now seen corresponding path program 1 times [2018-10-27 06:08:02,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:02,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash -290098769, now seen corresponding path program 1 times [2018-10-27 06:08:03,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:03,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:03,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:03,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,415 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-10-27 06:08:03,603 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-27 06:08:03,688 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:03,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:03,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:03,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:03,690 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:03,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:03,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:03,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:03,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:08:03,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:03,690 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:03,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,741 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,743 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,772 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,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,777 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,779 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,781 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,790 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,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,793 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,800 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:04,244 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-10-27 06:08:04,393 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-10-27 06:08:04,850 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:04,854 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:04,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,920 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:04,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,922 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:04,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,964 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:04,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,968 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:04,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:04,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:05,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,016 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:05,026 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:05,029 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:05,031 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:05,031 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:05,032 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:05,032 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-10-27 06:08:05,085 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:08:05,089 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:05,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:05,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:05,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:05,312 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:05,316 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 35 treesize of output 34 [2018-10-27 06:08:05,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:08:05,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,344 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:05,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:08:05,355 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:05,357 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:05,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-10-27 06:08:05,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 2. Second operand 8 states. Result 43 states and 46 transitions. Complement of second has 15 states. [2018-10-27 06:08:05,471 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:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-10-27 06:08:05,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 2 letters. Loop has 11 letters. [2018-10-27 06:08:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 13 letters. Loop has 11 letters. [2018-10-27 06:08:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 2 letters. Loop has 22 letters. [2018-10-27 06:08:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:05,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 46 transitions. [2018-10-27 06:08:05,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:08:05,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 43 transitions. [2018-10-27 06:08:05,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:08:05,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:08:05,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 43 transitions. [2018-10-27 06:08:05,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:05,479 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-10-27 06:08:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 43 transitions. [2018-10-27 06:08:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-10-27 06:08:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-27 06:08:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-10-27 06:08:05,481 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-10-27 06:08:05,482 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-10-27 06:08:05,482 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:05,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 41 transitions. [2018-10-27 06:08:05,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:08:05,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:05,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:05,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:05,483 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:05,483 INFO L793 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.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];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 260#L551-2 assume true; 271#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 240#L550-2 main_#t~short6 := main_#t~mem4 > 0; 241#L550-3 assume main_#t~short6; 244#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 249#L550-5 main_#t~short6 := main_#t~mem5 > 0; 250#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 257#L551 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 254#L554 [2018-10-27 06:08:05,484 INFO L795 eck$LassoCheckResult]: Loop: 254#L554 SUMMARY for call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 255#L554-1 havoc main_#t~nondet9; 252#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 253#L555-1 SUMMARY for call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 256#L555-2 havoc main_#t~mem10; 261#L551-2 assume true; 277#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 276#L550-2 main_#t~short6 := main_#t~mem4 > 0; 275#L550-3 assume main_#t~short6; 246#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 247#L550-5 main_#t~short6 := main_#t~mem5 > 0; 274#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 273#L551 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 254#L554 [2018-10-27 06:08:05,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash -470724655, now seen corresponding path program 1 times [2018-10-27 06:08:05,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:05,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash -922010546, now seen corresponding path program 1 times [2018-10-27 06:08:05,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:05,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1977213314, now seen corresponding path program 1 times [2018-10-27 06:08:05,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:05,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:05,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:05,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,897 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-10-27 06:08:05,940 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:05,941 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:05,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:05,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:05,941 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:05,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:05,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:05,941 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:05,941 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:08:05,941 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:05,941 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:05,944 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,963 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,965 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,967 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,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:05,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:05,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:05,973 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,975 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,976 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,980 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,981 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,983 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,235 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-10-27 06:08:06,311 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,662 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:06,662 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:06,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:06,664 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,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:06,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:06,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,672 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,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:06,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:06,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:06,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:06,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:06,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:06,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:06,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:06,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:06,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:06,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:06,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:06,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:06,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:06,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:06,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:06,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:06,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:06,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:06,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:06,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:06,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:06,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:06,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:06,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:06,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:06,779 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:06,789 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:06,789 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:08:06,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:06,790 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:06,791 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:06,791 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-10-27 06:08:07,017 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:08:07,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:07,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:07,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:07,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:07,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:08:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:07,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:07,189 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 19 treesize of output 20 [2018-10-27 06:08:07,208 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:07,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,291 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,297 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:07,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2018-10-27 06:08:07,327 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:07,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:07,332 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:07,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:07,381 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,387 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:07,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:08:07,542 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-10-27 06:08:07,585 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:07,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:08:07,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 41 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-10-27 06:08:07,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 41 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 73 states and 80 transitions. Complement of second has 13 states. [2018-10-27 06:08:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:08:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-10-27 06:08:07,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 10 letters. Loop has 13 letters. [2018-10-27 06:08:07,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:07,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 23 letters. Loop has 13 letters. [2018-10-27 06:08:07,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:07,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 10 letters. Loop has 26 letters. [2018-10-27 06:08:07,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:07,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 80 transitions. [2018-10-27 06:08:07,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:07,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 64 transitions. [2018-10-27 06:08:07,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:08:07,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:08:07,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 64 transitions. [2018-10-27 06:08:07,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:07,812 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-10-27 06:08:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 64 transitions. [2018-10-27 06:08:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-27 06:08:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 06:08:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-10-27 06:08:07,817 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-10-27 06:08:07,817 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-10-27 06:08:07,817 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:07,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 63 transitions. [2018-10-27 06:08:07,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:07,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:07,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:07,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:07,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:07,819 INFO L793 eck$LassoCheckResult]: Stem: 529#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 526#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.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];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 527#L551-2 assume true; 542#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 543#L550-2 main_#t~short6 := main_#t~mem4 > 0; 551#L550-3 assume main_#t~short6; 549#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 547#L550-5 main_#t~short6 := main_#t~mem5 > 0; 545#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 544#L551 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 520#L554 SUMMARY for call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 521#L554-1 havoc main_#t~nondet9; 518#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 519#L555-1 SUMMARY for call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 523#L555-2 havoc main_#t~mem10; 528#L551-2 assume true; 565#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 564#L550-2 main_#t~short6 := main_#t~mem4 > 0; 563#L550-3 assume main_#t~short6; 562#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 561#L550-5 main_#t~short6 := main_#t~mem5 > 0; 560#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 559#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 530#L552 [2018-10-27 06:08:07,819 INFO L795 eck$LassoCheckResult]: Loop: 530#L552 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 531#L552-1 SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 536#L552-2 havoc main_#t~mem8; 538#L551-2 assume true; 540#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 508#L550-2 main_#t~short6 := main_#t~mem4 > 0; 509#L550-3 assume main_#t~short6; 512#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 514#L550-5 main_#t~short6 := main_#t~mem5 > 0; 516#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 524#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 530#L552 [2018-10-27 06:08:07,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1977213319, now seen corresponding path program 1 times [2018-10-27 06:08:07,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:07,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:07,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1219141219, now seen corresponding path program 2 times [2018-10-27 06:08:07,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:07,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:07,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:07,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2003518699, now seen corresponding path program 1 times [2018-10-27 06:08:07,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:07,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:07,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:07,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:08,208 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 100 [2018-10-27 06:08:08,290 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:08,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:08,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:08,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:08,290 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:08,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:08,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:08,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:08,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:08:08,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:08,291 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:08,293 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:08,313 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:08,314 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:08,489 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-10-27 06:08:08,557 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:08,559 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:08,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,584 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:08,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,587 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:08,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,625 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:08,933 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:08,933 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:08,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:08,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,934 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:08,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,935 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:08,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:08,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:08,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:08,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:08,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,993 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:08,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,994 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:08,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:09,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:09,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:09,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:09,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:09,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:09,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:09,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:09,027 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:09,035 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:08:09,035 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:09,036 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:09,037 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:09,038 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:09,038 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-10-27 06:08:09,170 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:08:09,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:09,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:09,235 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:09,237 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:09,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:09,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:09,244 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:09,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:08:09,281 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:09,281 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:09,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 63 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:08:09,344 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 63 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 152 states and 163 transitions. Complement of second has 13 states. [2018-10-27 06:08:09,348 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:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-10-27 06:08:09,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 23 letters. Loop has 11 letters. [2018-10-27 06:08:09,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 34 letters. Loop has 11 letters. [2018-10-27 06:08:09,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 23 letters. Loop has 22 letters. [2018-10-27 06:08:09,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:09,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 163 transitions. [2018-10-27 06:08:09,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:09,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 103 states and 110 transitions. [2018-10-27 06:08:09,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-10-27 06:08:09,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-10-27 06:08:09,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 110 transitions. [2018-10-27 06:08:09,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:09,360 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-10-27 06:08:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 110 transitions. [2018-10-27 06:08:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-10-27 06:08:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-27 06:08:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-10-27 06:08:09,367 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-10-27 06:08:09,367 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-10-27 06:08:09,367 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:09,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 100 transitions. [2018-10-27 06:08:09,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:09,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:09,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:09,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:09,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:09,372 INFO L793 eck$LassoCheckResult]: Stem: 929#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 925#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.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];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 926#L551-2 assume true; 942#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 904#L550-2 main_#t~short6 := main_#t~mem4 > 0; 905#L550-3 assume main_#t~short6; 986#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 984#L550-5 main_#t~short6 := main_#t~mem5 > 0; 982#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 980#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 979#L552 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 977#L552-1 SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 975#L552-2 havoc main_#t~mem8; 973#L551-2 assume true; 971#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 902#L550-2 main_#t~short6 := main_#t~mem4 > 0; 903#L550-3 assume main_#t~short6; 906#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 967#L550-5 main_#t~short6 := main_#t~mem5 > 0; 922#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 923#L551 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 919#L554 SUMMARY for call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 920#L554-1 havoc main_#t~nondet9; 962#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 961#L555-1 SUMMARY for call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 960#L555-2 havoc main_#t~mem10; 959#L551-2 assume true; 957#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 955#L550-2 main_#t~short6 := main_#t~mem4 > 0; 953#L550-3 assume main_#t~short6; 951#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 949#L550-5 main_#t~short6 := main_#t~mem5 > 0; 947#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 944#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 930#L552 [2018-10-27 06:08:09,372 INFO L795 eck$LassoCheckResult]: Loop: 930#L552 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 931#L552-1 SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 934#L552-2 havoc main_#t~mem8; 937#L551-2 assume true; 958#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 956#L550-2 main_#t~short6 := main_#t~mem4 > 0; 954#L550-3 assume main_#t~short6; 952#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 950#L550-5 main_#t~short6 := main_#t~mem5 > 0; 948#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 946#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 930#L552 [2018-10-27 06:08:09,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1112464397, now seen corresponding path program 2 times [2018-10-27 06:08:09,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1219141219, now seen corresponding path program 3 times [2018-10-27 06:08:09,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:09,424 INFO L82 PathProgramCache]: Analyzing trace with hash 806224599, now seen corresponding path program 3 times [2018-10-27 06:08:09,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:09,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:09,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:09,568 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-10-27 06:08:10,011 WARN L179 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 123 [2018-10-27 06:08:10,102 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:10,102 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:10,102 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:10,102 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:10,102 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:10,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:10,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:10,102 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:10,102 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:08:10,102 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:10,103 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:10,105 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,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:10,121 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,122 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,124 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,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:10,127 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,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:10,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:10,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,133 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,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:10,295 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-10-27 06:08:10,356 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,358 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,360 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,646 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:10,646 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:10,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:10,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:10,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:10,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,694 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:10,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,695 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:10,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,737 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:10,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,738 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:10,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:10,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:10,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:10,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:10,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:10,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:10,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:10,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:10,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:10,783 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:10,790 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:08:10,791 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:10,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:10,791 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:10,792 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:10,792 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2018-10-27 06:08:10,860 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:08:10,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:10,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:10,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:10,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:10,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:10,909 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:10,913 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:10,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:10,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:10,921 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:10,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:08:10,972 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:10,972 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:10,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-10-27 06:08:11,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 135 states and 144 transitions. Complement of second has 13 states. [2018-10-27 06:08:11,031 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,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-10-27 06:08:11,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 34 letters. Loop has 11 letters. [2018-10-27 06:08:11,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:11,032 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:11,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:11,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:11,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:11,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,126 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:11,131 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:11,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,139 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:11,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:08:11,203 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,203 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:11,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-10-27 06:08:11,311 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 134 states and 141 transitions. Complement of second has 15 states. [2018-10-27 06:08:11,314 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:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-10-27 06:08:11,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 34 letters. Loop has 11 letters. [2018-10-27 06:08:11,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:11,315 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:11,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:11,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:11,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:11,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,380 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:11,383 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:11,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,389 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:11,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:08:11,431 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,432 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:11,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-10-27 06:08:11,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 157 states and 169 transitions. Complement of second has 14 states. [2018-10-27 06:08:11,545 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,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-10-27 06:08:11,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 34 letters. Loop has 11 letters. [2018-10-27 06:08:11,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:11,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 45 letters. Loop has 11 letters. [2018-10-27 06:08:11,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:11,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 34 letters. Loop has 22 letters. [2018-10-27 06:08:11,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:11,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 169 transitions. [2018-10-27 06:08:11,549 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:11,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 0 states and 0 transitions. [2018-10-27 06:08:11,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:11,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:11,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:11,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:11,550 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:11,550 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:11,550 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:11,550 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:11,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:11,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:11,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:11,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:11 BoogieIcfgContainer [2018-10-27 06:08:11,559 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:11,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:11,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:11,560 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:11,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:02" (3/4) ... [2018-10-27 06:08:11,563 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:11,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:11,564 INFO L168 Benchmark]: Toolchain (without parser) took 10003.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -61.9 MB). Peak memory consumption was 164.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:11,565 INFO L168 Benchmark]: CDTParser took 0.25 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:11,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.16 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.5 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:11,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 936.5 MB in the beginning and 1.2 GB in the end (delta: -216.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:11,567 INFO L168 Benchmark]: Boogie Preprocessor took 19.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:11,568 INFO L168 Benchmark]: RCFGBuilder took 491.38 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:11,568 INFO L168 Benchmark]: BuchiAutomizer took 9020.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.2 MB). Peak memory consumption was 182.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:11,568 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:11,571 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.25 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 365.16 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.5 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 936.5 MB in the beginning and 1.2 GB in the end (delta: -216.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 491.38 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9020.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.2 MB). Peak memory consumption was 182.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 6.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 93 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 140 SDtfs, 165 SDslu, 157 SDs, 0 SdLazy, 213 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax109 hnf100 lsp85 ukn90 mio100 lsp39 div100 bol100 ite100 ukn100 eq189 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...