./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/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 025e0289c8e9b33528493c96bf0a22ba3200731b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:02:49,911 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:02:49,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:02:49,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:02:49,919 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:02:49,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:02:49,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:02:49,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:02:49,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:02:49,923 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:02:49,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:02:49,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:02:49,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:02:49,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:02:49,926 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:02:49,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:02:49,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:02:49,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:02:49,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:02:49,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:02:49,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:02:49,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:02:49,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:02:49,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:02:49,932 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:02:49,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:02:49,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:02:49,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:02:49,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:02:49,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:02:49,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:02:49,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:02:49,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:02:49,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:02:49,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:02:49,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:02:49,938 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:02:49,949 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:02:49,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:02:49,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:02:49,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:02:49,950 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:02:49,950 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:02:49,950 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:02:49,950 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:02:49,951 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:02:49,951 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:02:49,951 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:02:49,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:02:49,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:02:49,951 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:02:49,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:02:49,952 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:02:49,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:02:49,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:02:49,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:02:49,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:02:49,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:02:49,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:02:49,952 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:02:49,953 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:02:49,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:02:49,953 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:02:49,953 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:02:49,953 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:02:49,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:02:49,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:02:49,954 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:02:49,954 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:02:49,954 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_d6c3d472-435d-40d7-a83f-93f2990d60e9/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 -> 025e0289c8e9b33528493c96bf0a22ba3200731b [2018-11-22 22:02:49,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:02:49,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:02:49,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:02:49,990 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:02:49,990 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:02:49,991 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-22 22:02:50,033 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/data/02df6da89/162d16ff66e84090ac5b7ef30806f209/FLAG2dadfe6f2 [2018-11-22 22:02:50,442 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:02:50,442 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-22 22:02:50,446 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/data/02df6da89/162d16ff66e84090ac5b7ef30806f209/FLAG2dadfe6f2 [2018-11-22 22:02:50,457 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/bin-2019/uautomizer/data/02df6da89/162d16ff66e84090ac5b7ef30806f209 [2018-11-22 22:02:50,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:02:50,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:02:50,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:02:50,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:02:50,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:02:50,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651809fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50, skipping insertion in model container [2018-11-22 22:02:50,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:02:50,494 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:02:50,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:02:50,625 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:02:50,635 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:02:50,645 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:02:50,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50 WrapperNode [2018-11-22 22:02:50,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:02:50,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:02:50,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:02:50,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:02:50,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:02:50,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:02:50,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:02:50,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:02:50,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... [2018-11-22 22:02:50,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:02:50,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:02:50,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:02:50,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:02:50,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6c3d472-435d-40d7-a83f-93f2990d60e9/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-22 22:02:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:02:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:02:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:02:50,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:02:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:02:50,862 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:02:50,862 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 22:02:50,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:50 BoogieIcfgContainer [2018-11-22 22:02:50,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:02:50,863 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:02:50,863 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:02:50,866 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:02:50,867 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:02:50,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:02:50" (1/3) ... [2018-11-22 22:02:50,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dd34b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:02:50, skipping insertion in model container [2018-11-22 22:02:50,868 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:02:50,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:50" (2/3) ... [2018-11-22 22:02:50,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dd34b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:02:50, skipping insertion in model container [2018-11-22 22:02:50,869 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:02:50,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:50" (3/3) ... [2018-11-22 22:02:50,871 INFO L375 chiAutomizerObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-22 22:02:50,905 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:02:50,906 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:02:50,906 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:02:50,906 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:02:50,906 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:02:50,906 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:02:50,906 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:02:50,906 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:02:50,906 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:02:50,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-22 22:02:50,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:02:50,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:02:50,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:02:50,942 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:02:50,942 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:02:50,942 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:02:50,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-22 22:02:50,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-22 22:02:50,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:02:50,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:02:50,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:02:50,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:02:50,951 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 15#L14true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 11#L16-3true [2018-11-22 22:02:50,952 INFO L796 eck$LassoCheckResult]: Loop: 11#L16-3true assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 16#L16-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 11#L16-3true [2018-11-22 22:02:50,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-22 22:02:50,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:50,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:50,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:02:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-11-22 22:02:51,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:51,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:51,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:02:51,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,051 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-11-22 22:02:51,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:51,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:51,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:02:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,209 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:02:51,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:02:51,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:02:51,210 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:02:51,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:02:51,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:02:51,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:02:51,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:02:51,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration1_Lasso [2018-11-22 22:02:51,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:02:51,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:02:51,228 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-22 22:02:51,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:02:51,328 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-22 22:02:51,332 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-22 22:02:51,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:02:51,335 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-22 22:02:51,338 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-22 22:02:51,340 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-22 22:02:51,342 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-22 22:02:51,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:02:51,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:02:51,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:51,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:51,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:02:51,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:51,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:51,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:51,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:02:51,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:02:51,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:51,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:51,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:51,530 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:02:51,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:51,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:51,533 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:02:51,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:51,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:51,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:51,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:51,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:02:51,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:51,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:51,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:51,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:02:51,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:02:51,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:51,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:51,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:51,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:51,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:51,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:51,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:02:51,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:51,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:51,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:51,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:51,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:51,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:51,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:51,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:02:51,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:51,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:51,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:51,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:51,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:51,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:51,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:51,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:02:51,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:51,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:02:51,618 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:02:51,618 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:02:51,620 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:02:51,621 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:02:51,622 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:02:51,622 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:02:51,659 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:02:51,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:02:51,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:02:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:02:51,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:02:51,708 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-22 22:02:51,718 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-22 22:02:51,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-11-22 22:02:51,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 40 states and 51 transitions. Complement of second has 7 states. [2018-11-22 22:02:51,756 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-22 22:02:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:02:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-22 22:02:51,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-22 22:02:51,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:02:51,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-22 22:02:51,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:02:51,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-22 22:02:51,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:02:51,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-11-22 22:02:51,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:02:51,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 13 transitions. [2018-11-22 22:02:51,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-22 22:02:51,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 22:02:51,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-22 22:02:51,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:02:51,769 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-22 22:02:51,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-22 22:02:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-22 22:02:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-22 22:02:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-22 22:02:51,786 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-22 22:02:51,786 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-22 22:02:51,786 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:02:51,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-22 22:02:51,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:02:51,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:02:51,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:02:51,787 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:02:51,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:02:51,787 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 112#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 117#L16-3 assume !(main_~i~0 < main_~n~0); 116#L16-4 main_~i~1 := 0; 110#L17-3 [2018-11-22 22:02:51,788 INFO L796 eck$LassoCheckResult]: Loop: 110#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 113#L5 assume !(0 == __VERIFIER_assert_~cond); 114#L5-2 havoc main_#t~mem5; 109#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 110#L17-3 [2018-11-22 22:02:51,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2018-11-22 22:02:51,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:51,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:02:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 1 times [2018-11-22 22:02:51,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:51,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:51,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:02:51,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1304171029, now seen corresponding path program 1 times [2018-11-22 22:02:51,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:51,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:02:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:02:51,862 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-22 22:02:51,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:02:51,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:02:51,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:02:51,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:02:51,930 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-22 22:02:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:02:51,959 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-22 22:02:51,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:02:51,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2018-11-22 22:02:51,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:02:51,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 13 transitions. [2018-11-22 22:02:51,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 22:02:51,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 22:02:51,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-22 22:02:51,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:02:51,962 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-22 22:02:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-22 22:02:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-22 22:02:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-22 22:02:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-22 22:02:51,964 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-22 22:02:51,964 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-22 22:02:51,964 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:02:51,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-22 22:02:51,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:02:51,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:02:51,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:02:51,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:02:51,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:02:51,966 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 153#L16-3 assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 154#L16-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 155#L16-3 assume !(main_~i~0 < main_~n~0); 152#L16-4 main_~i~1 := 0; 146#L17-3 [2018-11-22 22:02:51,966 INFO L796 eck$LassoCheckResult]: Loop: 146#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 149#L5 assume !(0 == __VERIFIER_assert_~cond); 150#L5-2 havoc main_#t~mem5; 145#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 146#L17-3 [2018-11-22 22:02:51,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2018-11-22 22:02:51,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:51,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:02:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 2 times [2018-11-22 22:02:51,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:51,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:02:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:51,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1358706313, now seen corresponding path program 1 times [2018-11-22 22:02:51,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:02:51,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:02:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:02:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:02:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:02:52,168 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:02:52,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:02:52,168 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:02:52,168 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:02:52,168 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:02:52,168 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:02:52,168 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:02:52,168 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:02:52,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration3_Lasso [2018-11-22 22:02:52,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:02:52,169 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:02:52,171 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-22 22:02:52,175 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-22 22:02:52,176 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-22 22:02:52,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:02:52,179 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-22 22:02:52,180 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-22 22:02:52,183 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-22 22:02:52,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:02:52,261 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-22 22:02:52,389 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:02:52,389 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:02:52,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:02:52,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:02:52,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:02:52,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:02:52,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:02:52,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:02:52,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:02:52,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:02:52,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:02:52,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:02:52,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:52,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:02:52,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:02:52,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:02:52,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:02:52,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:02:52,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:02:52,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,405 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:02:52,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,406 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:02:52,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:52,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:02:52,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:52,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:02:52,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:02:52,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:52,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:02:52,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:02:52,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:52,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:02:52,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-22 22:02:52,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:02:52,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:02:52,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:02:52,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:02:52,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:02:52,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:02:52,456 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:02:52,473 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 22:02:52,473 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 22:02:52,474 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:02:52,475 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:02:52,475 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:02:52,475 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~x~0.base)_2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_2 - 1*ULTIMATE.start_main_~x~0.offset - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-22 22:02:52,490 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:02:52,492 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:02:52,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:02:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:02:52,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:02:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:02:52,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:02:52,533 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-22 22:02:52,534 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-22 22:02:52,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-22 22:02:52,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 17 transitions. Complement of second has 4 states. [2018-11-22 22:02:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:02:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:02:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-22 22:02:52,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 22:02:52,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:02:52,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-22 22:02:52,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:02:52,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-22 22:02:52,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:02:52,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-22 22:02:52,547 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:02:52,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-22 22:02:52,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:02:52,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:02:52,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:02:52,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:02:52,548 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:02:52,548 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:02:52,548 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:02:52,548 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:02:52,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:02:52,548 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:02:52,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:02:52,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:02:52 BoogieIcfgContainer [2018-11-22 22:02:52,553 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:02:52,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:02:52,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:02:52,554 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:02:52,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:50" (3/4) ... [2018-11-22 22:02:52,557 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:02:52,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:02:52,558 INFO L168 Benchmark]: Toolchain (without parser) took 2097.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 958.2 MB in the beginning and 850.7 MB in the end (delta: 107.5 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:02:52,559 INFO L168 Benchmark]: CDTParser took 0.16 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-22 22:02:52,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.52 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:02:52,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.05 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:02:52,561 INFO L168 Benchmark]: Boogie Preprocessor took 53.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:02:52,561 INFO L168 Benchmark]: RCFGBuilder took 139.01 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: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:02:52,562 INFO L168 Benchmark]: BuchiAutomizer took 1689.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 850.7 MB in the end (delta: 269.9 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:02:52,563 INFO L168 Benchmark]: Witness Printer took 3.59 ms. Allocated memory is still 1.2 GB. Free memory is still 850.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:02:52,565 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.16 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 183.52 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.05 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.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 53.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 139.01 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: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1689.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 850.7 MB in the end (delta: 269.9 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.59 ms. Allocated memory is still 1.2 GB. Free memory is still 850.7 MB. 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 #length * 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 n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -1 * x + -4 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 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 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 30 SDslu, 28 SDs, 0 SdLazy, 29 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital108 mio100 ax100 hnf99 lsp91 ukn84 mio100 lsp65 div100 bol100 ite100 ukn100 eq165 hnf89 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...