./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/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 32bit --witnessprinter.graph.data.programhash 5375af47d6130a7bd98a5147355b5bb76e636a73 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:05:12,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:05:12,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:05:12,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:05:12,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:05:12,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:05:12,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:05:12,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:05:12,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:05:12,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:05:12,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:05:12,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:05:12,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:05:12,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:05:12,742 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:05:12,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:05:12,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:05:12,743 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:05:12,745 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:05:12,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:05:12,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:05:12,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:05:12,749 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:05:12,749 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:05:12,749 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:05:12,750 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:05:12,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:05:12,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:05:12,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:05:12,752 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:05:12,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:05:12,753 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:05:12,753 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:05:12,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:05:12,754 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:05:12,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:05:12,754 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 13:05:12,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:05:12,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:05:12,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:05:12,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:05:12,764 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:05:12,764 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:05:12,764 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:05:12,764 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:05:12,764 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:05:12,764 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:05:12,764 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:05:12,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:05:12,765 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:05:12,765 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:05:12,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:05:12,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:05:12,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:05:12,765 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:05:12,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:05:12,766 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:05:12,766 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:05:12,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:05:12,766 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:05:12,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:05:12,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:05:12,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:05:12,766 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:05:12,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:05:12,767 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:05:12,767 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:05:12,767 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:05:12,767 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_186d94ac-1e03-4606-ac99-2ebdf2e05931/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5375af47d6130a7bd98a5147355b5bb76e636a73 [2018-11-10 13:05:12,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:05:12,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:05:12,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:05:12,802 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:05:12,803 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:05:12,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i [2018-11-10 13:05:12,848 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/data/805a95af1/f565be5eda7b49878679ab8ba9ee4386/FLAG708faf6c7 [2018-11-10 13:05:13,142 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:05:13,142 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/sv-benchmarks/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i [2018-11-10 13:05:13,146 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/data/805a95af1/f565be5eda7b49878679ab8ba9ee4386/FLAG708faf6c7 [2018-11-10 13:05:13,154 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/data/805a95af1/f565be5eda7b49878679ab8ba9ee4386 [2018-11-10 13:05:13,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:05:13,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:05:13,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:05:13,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:05:13,160 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:05:13,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4104a14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13, skipping insertion in model container [2018-11-10 13:05:13,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:05:13,179 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:05:13,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:05:13,276 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:05:13,289 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:05:13,301 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:05:13,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13 WrapperNode [2018-11-10 13:05:13,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:05:13,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:05:13,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:05:13,302 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:05:13,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:05:13,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:05:13,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:05:13,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:05:13,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... [2018-11-10 13:05:13,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:05:13,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:05:13,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:05:13,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:05:13,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:05:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:05:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:05:13,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:05:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:05:13,618 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:05:13,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:05:13 BoogieIcfgContainer [2018-11-10 13:05:13,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:05:13,619 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:05:13,619 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:05:13,623 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:05:13,623 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:05:13,624 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:05:13" (1/3) ... [2018-11-10 13:05:13,625 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3645ff76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:05:13, skipping insertion in model container [2018-11-10 13:05:13,625 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:05:13,625 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:13" (2/3) ... [2018-11-10 13:05:13,625 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3645ff76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:05:13, skipping insertion in model container [2018-11-10 13:05:13,625 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:05:13,625 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:05:13" (3/3) ... [2018-11-10 13:05:13,627 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_single_elem_init_false-unreach-call_true-termination.i [2018-11-10 13:05:13,667 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:05:13,667 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:05:13,667 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:05:13,668 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:05:13,668 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:05:13,668 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:05:13,668 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:05:13,668 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:05:13,668 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:05:13,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 13:05:13,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 13:05:13,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:05:13,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:05:13,698 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:05:13,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:05:13,699 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:05:13,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 13:05:13,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 13:05:13,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:05:13,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:05:13,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:05:13,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:05:13,706 INFO L793 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;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_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;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_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;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_~#c~0.base, main_~#c~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0 := 0; 18#L10-4true [2018-11-10 13:05:13,707 INFO L795 eck$LassoCheckResult]: Loop: 18#L10-4true assume true; 24#L10-1true assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1; 32#L13true SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L13 30#L13-1true assume !(main_~q~0 == 0); 14#L14true SUMMARY for call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L14 23#L19true assume !(main_#t~mem2 != 0);havoc main_#t~mem2; 21#L10-3true main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 18#L10-4true [2018-11-10 13:05:13,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:05:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 13:05:13,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:05:13,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:05:13,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:13,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:05:13,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:05:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:05:13,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:05:13,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1195511926, now seen corresponding path program 1 times [2018-11-10 13:05:13,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:05:13,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:05:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:13,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:05:13,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:05:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:05:13,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:05:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash 350784904, now seen corresponding path program 1 times [2018-11-10 13:05:13,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:05:13,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:05:13,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:13,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:05:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:05:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:05:14,072 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:05:14,073 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:05:14,073 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:05:14,073 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:05:14,073 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:05:14,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:05:14,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:05:14,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:05:14,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 13:05:14,074 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:05:14,074 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:05:14,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,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-11-10 13:05:14,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,437 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:05:14,441 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:05:14,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:05:14,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:05:14,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:05:14,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:05:14,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,500 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:05:14,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,518 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:05:14,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,519 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:05:14,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:05:14,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:05:14,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:05:14,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:05:14,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:05:14,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:05:14,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,531 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:05:14,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,533 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:05:14,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:14,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:14,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:14,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:14,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:14,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:14,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:05:14,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:05:14,577 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:05:14,606 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 13:05:14,606 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 13:05:14,608 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:05:14,610 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:05:14,610 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:05:14,610 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2018-11-10 13:05:14,641 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 13:05:14,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:05:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:05:14,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:05:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:05:14,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:05:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:05:14,715 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 13:05:14,716 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 4 states. [2018-11-10 13:05:14,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 4 states. Result 60 states and 76 transitions. Complement of second has 8 states. [2018-11-10 13:05:14,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:05:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:05:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-10 13:05:14,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-10 13:05:14,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:05:14,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 13:05:14,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:05:14,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-10 13:05:14,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:05:14,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2018-11-10 13:05:14,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:05:14,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 28 states and 35 transitions. [2018-11-10 13:05:14,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 13:05:14,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 13:05:14,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-10 13:05:14,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:05:14,791 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-10 13:05:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-10 13:05:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 13:05:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 13:05:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-10 13:05:14,808 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-10 13:05:14,809 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-10 13:05:14,809 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:05:14,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2018-11-10 13:05:14,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:05:14,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:05:14,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:05:14,810 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 13:05:14,810 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 13:05:14,810 INFO L793 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;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_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;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_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;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_~#c~0.base, main_~#c~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0 := 0; 177#L10-4 assume true; 189#L10-1 assume !(main_~i~0 < 100000); 186#L10-5 SUMMARY for call write~int(1, main_~#a~0.base, main_~#a~0.offset + 60000, 4); srcloc: L10-5 187#L31 main_~i~0 := 0; 191#L32-4 [2018-11-10 13:05:14,810 INFO L795 eck$LassoCheckResult]: Loop: 191#L32-4 assume true; 174#L32-1 assume !!(main_~i~0 < 100000); 175#L34 assume !(main_~i~0 == 15000); 181#L32-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 191#L32-4 [2018-11-10 13:05:14,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:05:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash 889539431, now seen corresponding path program 1 times [2018-11-10 13:05:14,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:05:14,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:05:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:14,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:05:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:05:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:05:14,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:05:14,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:05:14,845 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 13:05:14,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:05:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2345064, now seen corresponding path program 1 times [2018-11-10 13:05:14,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:05:14,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:05:14,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:14,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:05:14,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:05:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:05:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:05:14,878 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:05:14,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:05:14,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:05:14,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:05:14,878 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:05:14,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:05:14,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:05:14,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:05:14,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 13:05:14,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:05:14,879 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:05:14,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:14,924 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:05:14,925 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:05:14,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:05:14,929 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:05:14,934 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:05:14,934 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:05:14,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:05:14,973 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_186d94ac-1e03-4606-ac99-2ebdf2e05931/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:05:15,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:05:15,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:05:15,064 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:05:15,065 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:05:15,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:05:15,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:05:15,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:05:15,066 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:05:15,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:05:15,066 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:05:15,066 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:05:15,066 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 13:05:15,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:05:15,066 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:05:15,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:15,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:05:15,218 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:05:15,218 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:05:15,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:15,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:15,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:05:15,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:15,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:05:15,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:15,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:05:15,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:05:15,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:05:15,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:05:15,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:05:15,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:05:15,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:05:15,222 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:05:15,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:05:15,223 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:05:15,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:05:15,229 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:05:15,231 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:05:15,231 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 13:05:15,231 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:05:15,231 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:05:15,231 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:05:15,231 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2018-11-10 13:05:15,232 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:05:15,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:05:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:05:15,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:05:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:05:15,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:05:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:05:15,266 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 13:05:15,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 13:05:15,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 57 transitions. Complement of second has 7 states. [2018-11-10 13:05:15,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:05:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:05:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-10 13:05:15,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-10 13:05:15,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:05:15,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-10 13:05:15,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:05:15,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-10 13:05:15,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:05:15,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-11-10 13:05:15,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:05:15,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2018-11-10 13:05:15,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:05:15,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:05:15,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:05:15,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:05:15,288 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:05:15,288 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:05:15,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:05:15,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:05:15,292 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 13:05:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:05:15,295 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 13:05:15,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:05:15,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 13:05:15,296 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:05:15,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:05:15,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:05:15,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:05:15,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:05:15,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:05:15,296 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:05:15,296 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:05:15,297 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:05:15,297 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:05:15,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:05:15,297 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:05:15,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:05:15,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:05:15 BoogieIcfgContainer [2018-11-10 13:05:15,302 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:05:15,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:05:15,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:05:15,302 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:05:15,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:05:13" (3/4) ... [2018-11-10 13:05:15,305 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:05:15,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:05:15,306 INFO L168 Benchmark]: Toolchain (without parser) took 2149.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 960.3 MB in the beginning and 920.1 MB in the end (delta: 40.2 MB). Peak memory consumption was 209.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:15,307 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:05:15,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.10 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:15,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.96 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:15,308 INFO L168 Benchmark]: Boogie Preprocessor took 21.38 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:05:15,309 INFO L168 Benchmark]: RCFGBuilder took 262.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:15,309 INFO L168 Benchmark]: BuchiAutomizer took 1682.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.1 MB in the end (delta: 224.3 MB). Peak memory consumption was 224.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:15,310 INFO L168 Benchmark]: Witness Printer took 3.21 ms. Allocated memory is still 1.2 GB. Free memory is still 920.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:05:15,312 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.10 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.96 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.38 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 262.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1682.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.1 MB in the end (delta: 224.3 MB). Peak memory consumption was 224.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.21 ms. Allocated memory is still 1.2 GB. Free memory is still 920.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 199999 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 199999 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 45 SDslu, 16 SDs, 0 SdLazy, 32 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital59 mio100 ax100 hnf100 lsp95 ukn90 mio100 lsp80 div100 bol100 ite100 ukn100 eq167 hnf94 smp100 dnf143 smp94 tf103 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...