./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cee692bfa384f30ecd519bc2dc9dfe35c80a4941 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:48:54,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:48:54,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:48:54,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:48:54,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:48:54,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:48:54,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:48:54,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:48:54,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:48:54,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:48:54,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:48:54,964 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:48:54,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:48:54,965 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:48:54,966 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:48:54,966 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:48:54,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:48:54,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:48:54,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:48:54,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:48:54,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:48:54,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:48:54,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:48:54,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:48:54,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:48:54,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:48:54,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:48:54,976 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:48:54,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:48:54,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:48:54,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:48:54,978 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:48:54,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:48:54,978 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:48:54,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:48:54,979 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:48:54,979 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:48:54,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:48:54,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:48:54,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:48:54,992 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:48:54,992 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:48:54,992 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:48:54,992 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:48:54,992 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:48:54,992 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:48:54,992 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:48:54,992 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:48:54,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:48:54,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:48:54,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:48:54,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:48:54,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:48:54,994 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:48:54,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:48:54,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:48:54,994 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:48:54,995 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:48:54,995 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_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cee692bfa384f30ecd519bc2dc9dfe35c80a4941 [2018-11-28 12:48:55,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:48:55,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:48:55,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:48:55,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:48:55,028 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:48:55,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c [2018-11-28 12:48:55,063 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/data/8d41b8c41/bbd4bd462e2a4d78af461ede1d6ee3f6/FLAGd558449f5 [2018-11-28 12:48:55,451 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:48:55,451 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/sv-benchmarks/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c [2018-11-28 12:48:55,455 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/data/8d41b8c41/bbd4bd462e2a4d78af461ede1d6ee3f6/FLAGd558449f5 [2018-11-28 12:48:55,465 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/data/8d41b8c41/bbd4bd462e2a4d78af461ede1d6ee3f6 [2018-11-28 12:48:55,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:48:55,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:48:55,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:48:55,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:48:55,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:48:55,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261ff106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55, skipping insertion in model container [2018-11-28 12:48:55,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:48:55,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:48:55,606 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:48:55,609 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:48:55,617 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:48:55,624 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:48:55,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55 WrapperNode [2018-11-28 12:48:55,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:48:55,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:48:55,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:48:55,625 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:48:55,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:48:55,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:48:55,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:48:55,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:48:55,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... [2018-11-28 12:48:55,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:48:55,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:48:55,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:48:55,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:48:55,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/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-28 12:48:55,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:48:55,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:48:55,795 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:48:55,796 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 12:48:55,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:48:55 BoogieIcfgContainer [2018-11-28 12:48:55,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:48:55,797 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:48:55,797 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:48:55,799 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:48:55,800 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:48:55,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:48:55" (1/3) ... [2018-11-28 12:48:55,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9c7e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:48:55, skipping insertion in model container [2018-11-28 12:48:55,801 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:48:55,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:48:55" (2/3) ... [2018-11-28 12:48:55,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9c7e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:48:55, skipping insertion in model container [2018-11-28 12:48:55,801 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:48:55,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:48:55" (3/3) ... [2018-11-28 12:48:55,803 INFO L375 chiAutomizerObserver]: Analyzing ICFG NO_23_false-termination_true-no-overflow.c [2018-11-28 12:48:55,834 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:48:55,835 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:48:55,835 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:48:55,835 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:48:55,835 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:48:55,835 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:48:55,835 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:48:55,835 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:48:55,835 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:48:55,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 12:48:55,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:48:55,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:48:55,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:48:55,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 12:48:55,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:48:55,860 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:48:55,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 12:48:55,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:48:55,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:48:55,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:48:55,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 12:48:55,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:48:55,865 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7#L10-2true [2018-11-28 12:48:55,865 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-2true assume !!(main_~i~0 < 100); 3#L10true assume main_~i~0 < 50;main_~i~0 := 51; 7#L10-2true [2018-11-28 12:48:55,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 12:48:55,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:55,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:55,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:55,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:55,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:55,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-28 12:48:55,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:55,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:55,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:55,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-28 12:48:55,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:55,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:55,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:55,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:55,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:55,980 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:48:55,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:48:55,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:48:55,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:48:55,982 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:48:55,982 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:55,982 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:48:55,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:48:55,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 12:48:55,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:48:55,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:48:56,001 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-28 12:48:56,019 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-28 12:48:56,026 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-28 12:48:56,086 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:48:56,086 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/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-28 12:48:56,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:48:56,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:48:56,108 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:48:56,108 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/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-28 12:48:56,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:48:56,111 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:48:56,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:48:56,126 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/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-28 12:48:56,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:48:56,128 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:48:56,148 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:48:56,186 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:48:56,187 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:48:56,187 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:48:56,187 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:48:56,187 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:48:56,187 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:48:56,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:48:56,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:48:56,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 12:48:56,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:48:56,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:48:56,189 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-28 12:48:56,194 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-28 12:48:56,204 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-28 12:48:56,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:48:56,236 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:48:56,238 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-28 12:48:56,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:56,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:56,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:56,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:56,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:48:56,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:48:56,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:56,251 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-28 12:48:56,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:56,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:56,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:56,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:56,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:56,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:48:56,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:56,259 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:48:56,264 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:48:56,264 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:48:56,265 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:48:56,265 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:48:56,265 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:48:56,266 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2018-11-28 12:48:56,266 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:48:56,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:56,308 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-28 12:48:56,318 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:48:56,319 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-11-28 12:48:56,348 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2018-11-28 12:48:56,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:48:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:48:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 12:48:56,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 12:48:56,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:56,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 12:48:56,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:56,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 12:48:56,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:56,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-28 12:48:56,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:48:56,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-11-28 12:48:56,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 12:48:56,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 12:48:56,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-11-28 12:48:56,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:48:56,362 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 12:48:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-11-28 12:48:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 12:48:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:48:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 12:48:56,386 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 12:48:56,386 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 12:48:56,386 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:48:56,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-28 12:48:56,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:48:56,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:48:56,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:48:56,387 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:48:56,387 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:48:56,387 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 68#L10-2 assume !!(main_~i~0 < 100); 63#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 64#L10-2 [2018-11-28 12:48:56,387 INFO L796 eck$LassoCheckResult]: Loop: 64#L10-2 assume !!(main_~i~0 < 100); 69#L10 assume main_~i~0 < 50;main_~i~0 := 51; 64#L10-2 [2018-11-28 12:48:56,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-28 12:48:56,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:56,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,415 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-28 12:48:56,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:48:56,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-28 12:48:56,418 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:48:56,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-28 12:48:56,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:56,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:56,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:56,447 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:48:56,447 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:48:56,447 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:48:56,447 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:48:56,447 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:48:56,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:48:56,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:48:56,448 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 12:48:56,448 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:48:56,448 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:48:56,449 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-28 12:48:56,454 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-28 12:48:56,464 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-28 12:48:56,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:48:56,494 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:48:56,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:48:56,516 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:48:56,516 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:48:56,519 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:48:56,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:48:56,573 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:48:56,574 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:48:56,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:48:56,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:48:56,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:48:56,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:48:56,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:48:56,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:48:56,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 12:48:56,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:48:56,575 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:48:56,576 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-28 12:48:56,580 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-28 12:48:56,581 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-28 12:48:56,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:48:56,632 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:48:56,632 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-28 12:48:56,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:56,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:56,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:56,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:56,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:56,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:48:56,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:56,636 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:48:56,639 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:48:56,639 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:48:56,640 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:48:56,640 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:48:56,640 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:48:56,640 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2018-11-28 12:48:56,640 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:48:56,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:56,656 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-28 12:48:56,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:48:56,657 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 12:48:56,666 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2018-11-28 12:48:56,667 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-28 12:48:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:48:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 12:48:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 12:48:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:48:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 12:48:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:56,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-11-28 12:48:56,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:48:56,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 12:48:56,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 12:48:56,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:48:56,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-28 12:48:56,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:48:56,670 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 12:48:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-28 12:48:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 12:48:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:48:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 12:48:56,672 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 12:48:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:48:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:48:56,675 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2018-11-28 12:48:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:48:56,681 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2018-11-28 12:48:56,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:48:56,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-28 12:48:56,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:48:56,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-28 12:48:56,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 12:48:56,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:48:56,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 12:48:56,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:48:56,682 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 12:48:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 12:48:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-28 12:48:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:48:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-28 12:48:56,684 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 12:48:56,684 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 12:48:56,684 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:48:56,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-28 12:48:56,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:48:56,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:48:56,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:48:56,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2018-11-28 12:48:56,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:48:56,685 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 144#L10-2 assume !!(main_~i~0 < 100); 145#L10 assume main_~i~0 < 50;main_~i~0 := 51; 149#L10-2 assume !!(main_~i~0 < 100); 139#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 140#L10-2 assume !!(main_~i~0 < 100); 146#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 148#L10-2 [2018-11-28 12:48:56,685 INFO L796 eck$LassoCheckResult]: Loop: 148#L10-2 assume !!(main_~i~0 < 100); 147#L10 assume main_~i~0 < 50;main_~i~0 := 51; 148#L10-2 [2018-11-28 12:48:56,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1366043347, now seen corresponding path program 1 times [2018-11-28 12:48:56,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:56,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:56,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:48:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:48:56,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:48:56,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:48:56,695 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:48:56,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:56,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-11-28 12:48:56,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:56,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:56,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:56,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:56,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:56,713 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:48:56,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:48:56,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:48:56,714 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:48:56,714 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:48:56,714 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,714 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:48:56,714 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:48:56,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 12:48:56,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:48:56,715 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:48:56,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:48:56,718 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-28 12:48:56,731 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-28 12:48:56,758 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:48:56,758 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:48:56,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:48:56,778 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:48:56,778 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:48:56,781 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:48:56,810 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:48:56,847 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:48:56,848 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:48:56,848 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:48:56,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:48:56,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:48:56,848 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:48:56,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:56,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:48:56,849 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:48:56,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 12:48:56,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:48:56,849 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:48:56,850 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-28 12:48:56,852 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-28 12:48:56,856 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-28 12:48:56,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:48:56,892 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:48:56,893 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-28 12:48:56,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:56,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:56,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:56,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:56,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:48:56,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:48:56,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:56,900 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-28 12:48:56,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:56,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:56,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:56,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:56,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:56,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:48:56,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:56,905 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:48:56,909 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:48:56,910 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:48:56,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:48:56,910 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:48:56,910 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:48:56,910 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2018-11-28 12:48:56,911 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:48:56,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:56,962 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-28 12:48:56,962 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:48:56,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:48:56,969 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2018-11-28 12:48:56,969 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-28 12:48:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:48:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 12:48:56,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 12:48:56,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:56,970 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:48:56,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:56,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:56,989 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-28 12:48:56,990 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:48:56,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:48:56,997 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2018-11-28 12:48:56,997 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-28 12:48:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:48:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 12:48:56,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 12:48:56,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:56,998 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:48:57,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:57,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:48:57,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:48:57,011 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-28 12:48:57,012 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 12:48:57,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:48:57,018 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2018-11-28 12:48:57,018 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-28 12:48:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:48:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 12:48:57,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 12:48:57,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:57,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 12:48:57,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:57,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 12:48:57,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:48:57,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2018-11-28 12:48:57,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:48:57,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2018-11-28 12:48:57,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 12:48:57,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:48:57,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2018-11-28 12:48:57,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:48:57,022 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 12:48:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2018-11-28 12:48:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2018-11-28 12:48:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:48:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-11-28 12:48:57,023 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2018-11-28 12:48:57,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:48:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:48:57,023 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 3 states. [2018-11-28 12:48:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:48:57,029 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-11-28 12:48:57,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:48:57,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2018-11-28 12:48:57,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:48:57,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 7 states and 8 transitions. [2018-11-28 12:48:57,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 12:48:57,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-28 12:48:57,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-28 12:48:57,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:48:57,031 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 12:48:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-28 12:48:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 5. [2018-11-28 12:48:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:48:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2018-11-28 12:48:57,032 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2018-11-28 12:48:57,032 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2018-11-28 12:48:57,032 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:48:57,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2018-11-28 12:48:57,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:48:57,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:48:57,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:48:57,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 12:48:57,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-28 12:48:57,033 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 315#L10-2 [2018-11-28 12:48:57,033 INFO L796 eck$LassoCheckResult]: Loop: 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2018-11-28 12:48:57,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 12:48:57,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:57,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:57,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:48:57,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 1 times [2018-11-28 12:48:57,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:57,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:48:57,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 2 times [2018-11-28 12:48:57,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:48:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,060 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:48:57,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:48:57,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:48:57,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:48:57,060 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:48:57,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:57,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:48:57,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:48:57,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-28 12:48:57,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:48:57,061 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:48:57,062 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-28 12:48:57,070 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-28 12:48:57,071 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-28 12:48:57,072 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-28 12:48:57,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:48:57,101 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:57,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:48:57,103 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:57,120 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:48:57,120 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:48:57,136 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:48:57,137 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:48:57,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:48:57,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:48:57,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:48:57,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:48:57,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:48:57,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:48:57,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:48:57,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-28 12:48:57,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:48:57,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:48:57,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:48:57,143 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-28 12:48:57,145 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-28 12:48:57,149 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-28 12:48:57,174 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:48:57,174 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:48:57,175 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-28 12:48:57,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:57,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:48:57,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:48:57,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:48:57,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:57,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:48:57,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:48:57,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,189 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-28 12:48:57,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:57,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:48:57,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,193 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-28 12:48:57,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:48:57,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:48:57,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:48:57,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,197 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 12:48:57,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:48:57,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,198 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:48:57,199 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 12:48:57,200 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 12:48:57,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,211 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-28 12:48:57,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,212 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:48:57,215 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 12:48:57,215 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 12:48:57,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,220 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-28 12:48:57,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,221 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:48:57,224 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:48:57,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,225 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-28 12:48:57,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,226 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:48:57,230 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 12:48:57,230 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 12:48:57,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,232 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 12:48:57,233 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-28 12:48:57,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,234 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,235 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,236 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,255 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-28 12:48:57,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,256 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,257 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,257 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:48:57,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,263 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,264 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:48:57,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,264 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-28 12:48:57,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,269 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,270 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,270 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,273 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 12:48:57,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:48:57,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,275 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:48:57,276 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 12:48:57,277 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-28 12:48:57,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,289 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-28 12:48:57,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,291 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:48:57,293 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 12:48:57,293 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-28 12:48:57,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,298 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-28 12:48:57,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,299 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:48:57,299 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:48:57,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:48:57,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:48:57,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,301 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:48:57,306 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 12:48:57,306 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-28 12:48:57,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,308 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 12:48:57,309 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-28 12:48:57,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,309 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:48:57,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,310 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:48:57,310 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 12:48:57,311 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 12:48:57,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,319 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-28 12:48:57,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,320 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:48:57,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,320 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:48:57,321 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 12:48:57,321 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 12:48:57,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,325 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-28 12:48:57,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,330 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:48:57,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,330 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:48:57,331 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:48:57,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,332 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-28 12:48:57,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,332 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:48:57,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,332 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:48:57,334 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 12:48:57,334 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 12:48:57,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,337 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 12:48:57,337 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-28 12:48:57,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,339 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:48:57,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,339 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,341 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,341 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,355 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-28 12:48:57,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,355 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:48:57,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,355 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,356 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,356 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,362 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-28 12:48:57,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,363 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:48:57,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,363 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,364 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:48:57,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,369 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-28 12:48:57,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,369 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:48:57,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,370 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,371 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,371 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,374 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 12:48:57,374 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-28 12:48:57,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,375 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:48:57,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,375 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:48:57,377 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 12:48:57,377 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-28 12:48:57,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,392 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-28 12:48:57,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,392 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:48:57,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,393 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:48:57,396 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 12:48:57,397 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-28 12:48:57,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,402 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-28 12:48:57,403 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,403 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:48:57,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,403 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:48:57,404 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:48:57,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,405 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-28 12:48:57,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,406 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:48:57,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,406 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:48:57,408 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 12:48:57,408 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-28 12:48:57,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,413 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 12:48:57,414 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-28 12:48:57,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,414 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:48:57,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,415 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,416 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,416 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,430 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-28 12:48:57,430 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,430 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:48:57,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,430 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,431 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,431 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,436 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-28 12:48:57,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,437 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:48:57,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,437 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:48:57,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,439 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-28 12:48:57,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,439 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:48:57,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,440 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:48:57,441 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:48:57,441 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:48:57,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,444 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 12:48:57,444 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-28 12:48:57,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,445 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:48:57,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,445 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:48:57,447 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-28 12:48:57,448 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-28 12:48:57,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,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-28 12:48:57,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,488 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:48:57,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,489 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:48:57,490 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-28 12:48:57,490 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-28 12:48:57,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,494 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-28 12:48:57,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,495 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:48:57,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:48:57,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,495 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:48:57,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:48:57,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:48:57,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,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-28 12:48:57,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:48:57,499 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:48:57,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:48:57,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:48:57,499 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:48:57,500 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-28 12:48:57,500 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-28 12:48:57,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:48:57,504 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2018-11-28 12:48:57,504 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2018-11-28 12:48:57,504 INFO L796 eck$LassoCheckResult]: Loop: 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2018-11-28 12:48:57,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 3 times [2018-11-28 12:48:57,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:57,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:57,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:48:57,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 2 times [2018-11-28 12:48:57,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:57,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:57,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:48:57,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:48:57,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1492334512, now seen corresponding path program 4 times [2018-11-28 12:48:57,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:48:57,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:48:57,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:48:57,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:48:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:48:57,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:48:57 BoogieIcfgContainer [2018-11-28 12:48:57,585 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:48:57,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:48:57,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:48:57,585 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:48:57,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:48:55" (3/4) ... [2018-11-28 12:48:57,588 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 12:48:57,614 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_96d3ad53-7eea-4e4b-8fd7-238b44648f3a/bin-2019/uautomizer/witness.graphml [2018-11-28 12:48:57,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:48:57,615 INFO L168 Benchmark]: Toolchain (without parser) took 2147.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 953.3 MB in the beginning and 804.0 MB in the end (delta: 149.3 MB). Peak memory consumption was 282.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:48:57,615 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:48:57,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.81 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 945.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:48:57,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.98 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 942.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:48:57,616 INFO L168 Benchmark]: Boogie Preprocessor took 10.91 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:48:57,617 INFO L168 Benchmark]: RCFGBuilder took 141.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:48:57,617 INFO L168 Benchmark]: BuchiAutomizer took 1788.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 807.5 MB in the end (delta: 312.6 MB). Peak memory consumption was 312.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:48:57,617 INFO L168 Benchmark]: Witness Printer took 28.97 ms. Allocated memory is still 1.2 GB. Free memory was 807.5 MB in the beginning and 804.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:48:57,620 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.81 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 945.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.98 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 942.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.91 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 141.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1788.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 807.5 MB in the end (delta: 312.6 MB). Peak memory consumption was 312.6 MB. Max. memory is 11.5 GB. * Witness Printer took 28.97 ms. Allocated memory is still 1.2 GB. Free memory was 807.5 MB in the beginning and 804.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + 50 and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 50 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + 50 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 22 SDslu, 3 SDs, 0 SdLazy, 39 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax250 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf91 smp100 dnf100 smp100 tf118 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, i=49} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 Loop: [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...