./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_23.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_23.c -s /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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.24-cad4683 [2019-11-15 21:56:37,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:56:37,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:56:37,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:56:37,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:56:37,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:56:37,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:56:37,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:56:37,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:56:37,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:56:37,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:56:37,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:56:37,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:56:37,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:56:37,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:56:37,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:56:37,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:56:37,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:56:37,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:56:37,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:56:37,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:56:37,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:56:37,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:56:37,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:56:37,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:56:37,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:56:37,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:56:37,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:56:37,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:56:37,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:56:37,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:56:37,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:56:37,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:56:37,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:56:37,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:56:37,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:56:37,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:56:37,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:56:37,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:56:37,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:56:37,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:56:37,776 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:56:37,804 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:56:37,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:56:37,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:56:37,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:56:37,812 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:56:37,812 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:56:37,813 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:56:37,813 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:56:37,813 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:56:37,813 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:56:37,813 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:56:37,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:56:37,814 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:56:37,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:56:37,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:56:37,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:56:37,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:56:37,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:56:37,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:56:37,815 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:56:37,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:56:37,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:56:37,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:56:37,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:56:37,816 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:56:37,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:56:37,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:56:37,821 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:56:37,822 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:56:37,823 INFO L138 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/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:37,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:56:37,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:56:37,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:56:37,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:56:37,885 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:56:37,886 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NO_23.c [2019-11-15 21:56:37,939 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/data/9fa486a72/6fd5ff6e3e4d44159e8b1d27c36e7f5c/FLAG2388572c8 [2019-11-15 21:56:38,291 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:56:38,292 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/sv-benchmarks/c/termination-restricted-15/NO_23.c [2019-11-15 21:56:38,297 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/data/9fa486a72/6fd5ff6e3e4d44159e8b1d27c36e7f5c/FLAG2388572c8 [2019-11-15 21:56:38,694 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/data/9fa486a72/6fd5ff6e3e4d44159e8b1d27c36e7f5c [2019-11-15 21:56:38,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:56:38,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:56:38,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:56:38,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:56:38,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:56:38,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:56:38" (1/1) ... [2019-11-15 21:56:38,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3658c5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:38, skipping insertion in model container [2019-11-15 21:56:38,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:56:38" (1/1) ... [2019-11-15 21:56:38,714 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:56:38,732 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:56:38,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:56:38,932 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:56:39,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:56:39,061 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:56:39,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39 WrapperNode [2019-11-15 21:56:39,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:56:39,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:56:39,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:56:39,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:56:39,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:56:39,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:56:39,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:56:39,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:56:39,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... [2019-11-15 21:56:39,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:56:39,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:56:39,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:56:39,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:56:39,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:56:39,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:56:39,303 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:56:39,304 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:56:39,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:39 BoogieIcfgContainer [2019-11-15 21:56:39,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:56:39,306 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:56:39,306 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:56:39,309 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:56:39,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:39,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:56:38" (1/3) ... [2019-11-15 21:56:39,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dcc957f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:56:39, skipping insertion in model container [2019-11-15 21:56:39,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:39,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:39" (2/3) ... [2019-11-15 21:56:39,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dcc957f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:56:39, skipping insertion in model container [2019-11-15 21:56:39,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:39,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:39" (3/3) ... [2019-11-15 21:56:39,314 INFO L371 chiAutomizerObserver]: Analyzing ICFG NO_23.c [2019-11-15 21:56:39,360 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:56:39,360 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:56:39,360 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:56:39,361 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:56:39,361 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:56:39,361 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:56:39,361 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:56:39,361 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:56:39,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-15 21:56:39,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:39,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:39,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:39,402 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:56:39,402 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:56:39,403 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:56:39,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-15 21:56:39,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:39,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:39,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:39,404 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:56:39,404 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:56:39,412 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7#L10-2true [2019-11-15 21:56:39,412 INFO L793 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 [2019-11-15 21:56:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 21:56:39,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:39,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108459878] [2019-11-15 21:56:39,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:39,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:39,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:39,519 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-15 21:56:39,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:39,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900367646] [2019-11-15 21:56:39,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:39,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:39,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:39,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:39,533 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-15 21:56:39,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:39,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705031293] [2019-11-15 21:56:39,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:39,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:39,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:39,545 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:39,596 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:39,597 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:39,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:39,597 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:39,597 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:56:39,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:39,598 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:39,598 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:39,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23.c_Iteration1_Loop [2019-11-15 21:56:39,598 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:39,599 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:39,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:39,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:39,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:39,764 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:39,765 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:39,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:56:39,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:56:39,790 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:56:39,790 INFO L440 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/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:39,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:56:39,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:56:39,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:56:39,806 INFO L440 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/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:39,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:56:39,813 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:39,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:56:39,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:56:39,850 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:56:39,852 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:39,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:39,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:39,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:39,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:56:39,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:39,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:39,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:39,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23.c_Iteration1_Loop [2019-11-15 21:56:39,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:39,853 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:39,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:39,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:39,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:39,951 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:39,957 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:56:39,959 INFO L120 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 [2019-11-15 21:56:39,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:39,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:39,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:39,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:39,974 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:39,974 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:39,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:40,000 INFO L120 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 [2019-11-15 21:56:40,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:40,002 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:40,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:40,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:40,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:40,009 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:40,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:40,026 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:56:40,047 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:56:40,048 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:56:40,051 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:56:40,051 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:56:40,060 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:56:40,060 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2019-11-15 21:56:40,064 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:56:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:40,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:40,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:40,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:56:40,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:40,140 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 [2019-11-15 21:56:40,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-11-15 21:56:40,187 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. [2019-11-15 21:56:40,188 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 [2019-11-15 21:56:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-15 21:56:40,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-15 21:56:40,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:40,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 21:56:40,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:40,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-15 21:56:40,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:40,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-15 21:56:40,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:40,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-11-15 21:56:40,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-15 21:56:40,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-15 21:56:40,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-11-15 21:56:40,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:56:40,201 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-15 21:56:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-11-15 21:56:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 21:56:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 21:56:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-15 21:56:40,223 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-15 21:56:40,223 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-15 21:56:40,223 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:56:40,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-15 21:56:40,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:40,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:40,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:40,224 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:56:40,224 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:56:40,225 INFO L791 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 [2019-11-15 21:56:40,225 INFO L793 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 [2019-11-15 21:56:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-15 21:56:40,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:40,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549968939] [2019-11-15 21:56:40,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:40,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:40,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:40,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549968939] [2019-11-15 21:56:40,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:56:40,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-15 21:56:40,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773796221] [2019-11-15 21:56:40,265 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:56:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-15 21:56:40,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:40,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991398498] [2019-11-15 21:56:40,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:40,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:40,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:40,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:40,295 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:40,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:40,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:40,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:40,295 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:56:40,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:40,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:40,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:40,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23.c_Iteration2_Loop [2019-11-15 21:56:40,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:40,296 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:40,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,374 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:40,374 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:40,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:56:40,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:56:40,383 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:56:40,383 INFO L440 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/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:40,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:56:40,410 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:56:40,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:56:40,433 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:40,456 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:56:40,463 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:40,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:40,463 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:40,463 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:40,463 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:56:40,463 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:40,463 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:40,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:40,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23.c_Iteration2_Loop [2019-11-15 21:56:40,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:40,464 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:40,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,539 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:40,539 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:56:40,539 INFO L120 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 [2019-11-15 21:56:40,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:40,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:40,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:40,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:40,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:40,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:40,542 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:40,549 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:56:40,561 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:56:40,566 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:56:40,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:56:40,567 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:56:40,567 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:56:40,567 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2019-11-15 21:56:40,568 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:56:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:40,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:40,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:40,595 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:56:40,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:40,596 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 [2019-11-15 21:56:40,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:56:40,611 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. [2019-11-15 21:56:40,612 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 [2019-11-15 21:56:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-15 21:56:40,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 21:56:40,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:40,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 21:56:40,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:40,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-15 21:56:40,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:40,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-11-15 21:56:40,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:40,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-11-15 21:56:40,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 21:56:40,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 21:56:40,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-15 21:56:40,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:56:40,616 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-15 21:56:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-15 21:56:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 21:56:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 21:56:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-15 21:56:40,618 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-15 21:56:40,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:56:40,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:56:40,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:56:40,622 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2019-11-15 21:56:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:56:40,635 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-11-15 21:56:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:56:40,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-11-15 21:56:40,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:40,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-11-15 21:56:40,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 21:56:40,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 21:56:40,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-15 21:56:40,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:56:40,638 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 21:56:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-15 21:56:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-15 21:56:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 21:56:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-11-15 21:56:40,640 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 21:56:40,641 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 21:56:40,641 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:56:40,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-11-15 21:56:40,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:40,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:40,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:40,643 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2019-11-15 21:56:40,643 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:56:40,643 INFO L791 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 [2019-11-15 21:56:40,643 INFO L793 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 [2019-11-15 21:56:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1366043347, now seen corresponding path program 1 times [2019-11-15 21:56:40,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:40,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496028930] [2019-11-15 21:56:40,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:40,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:40,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:56:40,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496028930] [2019-11-15 21:56:40,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:56:40,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:56:40,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152255380] [2019-11-15 21:56:40,666 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:56:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-15 21:56:40,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:40,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203027178] [2019-11-15 21:56:40,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:40,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:40,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:40,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:40,706 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:40,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:40,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:40,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:40,707 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:56:40,707 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:40,707 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:40,707 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:40,707 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23.c_Iteration3_Loop [2019-11-15 21:56:40,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:40,708 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:40,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,755 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:40,755 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:56:40,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:56:40,764 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:40,770 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:56:40,771 INFO L440 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/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:56:40,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:56:40,792 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:56:40,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:56:40,817 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:40,841 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:56:40,844 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:40,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:40,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:40,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:40,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:56:40,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:40,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:40,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:40,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23.c_Iteration3_Loop [2019-11-15 21:56:40,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:40,845 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:40,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:40,913 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:40,913 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:56:40,914 INFO L120 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 [2019-11-15 21:56:40,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:40,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:40,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:40,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:40,917 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:40,917 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:40,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:40,932 INFO L120 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 [2019-11-15 21:56:40,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:40,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:40,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:40,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:40,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:40,939 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:40,939 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:40,949 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:56:40,957 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:56:40,960 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:56:40,961 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:56:40,962 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:56:40,962 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:56:40,962 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2019-11-15 21:56:40,963 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:56:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:40,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:40,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:41,003 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:56:41,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:41,005 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 [2019-11-15 21:56:41,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 21:56:41,028 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. [2019-11-15 21:56:41,030 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 [2019-11-15 21:56:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-15 21:56:41,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:56:41,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:41,031 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:56:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:41,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:41,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:41,072 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:56:41,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:41,073 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 [2019-11-15 21:56:41,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 21:56:41,090 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. [2019-11-15 21:56:41,091 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 [2019-11-15 21:56:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-15 21:56:41,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:56:41,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:41,092 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:56:41,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:41,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:41,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:41,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:56:41,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:41,126 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 [2019-11-15 21:56:41,127 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 21:56:41,149 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. [2019-11-15 21:56:41,151 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 [2019-11-15 21:56:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-15 21:56:41,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:56:41,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:41,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 21:56:41,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:41,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:56:41,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:41,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2019-11-15 21:56:41,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:56:41,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2019-11-15 21:56:41,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-15 21:56:41,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 21:56:41,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-15 21:56:41,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:56:41,156 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 21:56:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-15 21:56:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2019-11-15 21:56:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 21:56:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-11-15 21:56:41,157 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-11-15 21:56:41,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:56:41,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:56:41,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:56:41,158 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 3 states. [2019-11-15 21:56:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:56:41,175 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-11-15 21:56:41,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:56:41,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-11-15 21:56:41,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:56:41,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 7 states and 8 transitions. [2019-11-15 21:56:41,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-15 21:56:41,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-15 21:56:41,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-15 21:56:41,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:56:41,178 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 21:56:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-15 21:56:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 5. [2019-11-15 21:56:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:56:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-11-15 21:56:41,179 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-15 21:56:41,179 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-15 21:56:41,180 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:56:41,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-11-15 21:56:41,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:56:41,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:41,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:41,181 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:56:41,181 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-15 21:56:41,181 INFO L791 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 315#L10-2 [2019-11-15 21:56:41,181 INFO L793 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 [2019-11-15 21:56:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:41,184 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 21:56:41,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:41,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591263816] [2019-11-15 21:56:41,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:41,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:41,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:41,207 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 1 times [2019-11-15 21:56:41,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:41,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329728849] [2019-11-15 21:56:41,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:41,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:41,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:41,221 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 2 times [2019-11-15 21:56:41,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:41,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555988973] [2019-11-15 21:56:41,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:41,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:41,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:41,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:41,275 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:41,276 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:41,276 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:41,276 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:41,276 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:56:41,276 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:41,276 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:41,276 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:41,276 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23.c_Iteration4_Lasso [2019-11-15 21:56:41,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:41,277 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:41,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:41,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:41,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:41,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:41,373 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:41,373 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/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 [2019-11-15 21:56:41,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:56:41,383 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:56:41,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:56:41,403 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:41,412 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:56:41,414 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:41,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:41,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:41,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:41,415 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:56:41,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:41,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:41,415 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:41,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23.c_Iteration4_Lasso [2019-11-15 21:56:41,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:41,416 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:41,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:41,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:41,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:41,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:41,512 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:41,512 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:56:41,513 INFO L120 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 [2019-11-15 21:56:41,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:41,516 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:41,516 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:41,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,545 INFO L120 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 [2019-11-15 21:56:41,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,548 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:41,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:41,554 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:41,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,559 INFO L120 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 [2019-11-15 21:56:41,560 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,560 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:41,560 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,561 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:41,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:41,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:41,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,563 INFO L120 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 [2019-11-15 21:56:41,563 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:41,565 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:41,565 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:41,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,568 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:56:41,569 INFO L120 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 [2019-11-15 21:56:41,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,570 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:56:41,573 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:56:41,573 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:56:41,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,589 INFO L120 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 [2019-11-15 21:56:41,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,590 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:56:41,592 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:56:41,592 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:56:41,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,599 INFO L120 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 [2019-11-15 21:56:41,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:41,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,600 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:56:41,601 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:56:41,601 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:41,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,602 INFO L120 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 [2019-11-15 21:56:41,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,604 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:56:41,606 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:56:41,606 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:56:41,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,609 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:56:41,610 INFO L120 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 [2019-11-15 21:56:41,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,611 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,614 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:41,614 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:41,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,642 INFO L120 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 [2019-11-15 21:56:41,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,644 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,646 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:41,646 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:41,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,653 INFO L120 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 [2019-11-15 21:56:41,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:41,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,655 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,656 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:56:41,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:41,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,657 INFO L120 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 [2019-11-15 21:56:41,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,659 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,661 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:41,661 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:41,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,666 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:56:41,666 INFO L120 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 [2019-11-15 21:56:41,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,678 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:56:41,681 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 21:56:41,681 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 21:56:41,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,701 INFO L120 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 [2019-11-15 21:56:41,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,703 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,703 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:56:41,705 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 21:56:41,706 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 21:56:41,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,713 INFO L120 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 [2019-11-15 21:56:41,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:41,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,715 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:56:41,716 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:56:41,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:41,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,717 INFO L120 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 [2019-11-15 21:56:41,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:41,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,719 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:56:41,721 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 21:56:41,722 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 21:56:41,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,726 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:56:41,727 INFO L120 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 [2019-11-15 21:56:41,728 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,728 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:56:41,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,729 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:56:41,731 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:56:41,732 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:56:41,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,763 INFO L120 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 [2019-11-15 21:56:41,765 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,765 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:56:41,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,766 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:56:41,774 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:56:41,774 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:56:41,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,785 INFO L120 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 [2019-11-15 21:56:41,786 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,786 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:56:41,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:41,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,787 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:56:41,788 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:56:41,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:41,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,789 INFO L120 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 [2019-11-15 21:56:41,790 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,790 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:56:41,790 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,791 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:56:41,792 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:56:41,793 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:56:41,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,799 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:56:41,800 INFO L120 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 [2019-11-15 21:56:41,800 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,801 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:56:41,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,803 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,806 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:41,806 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:41,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,874 INFO L120 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 [2019-11-15 21:56:41,875 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,875 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:56:41,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,875 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,879 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:41,879 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:41,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,890 INFO L120 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 [2019-11-15 21:56:41,891 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,892 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:56:41,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:41,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,893 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,894 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:56:41,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:41,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,899 INFO L120 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 [2019-11-15 21:56:41,902 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,902 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:56:41,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,903 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,905 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:41,905 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:41,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,913 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:56:41,914 INFO L120 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 [2019-11-15 21:56:41,914 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,915 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:56:41,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,915 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:56:41,919 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 21:56:41,919 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 21:56:41,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,950 INFO L120 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 [2019-11-15 21:56:41,953 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,954 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:56:41,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,954 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:56:41,957 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 21:56:41,957 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 21:56:41,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,968 INFO L120 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 [2019-11-15 21:56:41,969 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,970 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:56:41,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:41,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,970 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:56:41,971 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:56:41,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:41,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,973 INFO L120 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 [2019-11-15 21:56:41,974 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,974 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:56:41,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,975 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:56:41,977 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 21:56:41,977 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 21:56:41,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:41,993 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:56:41,994 INFO L120 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 [2019-11-15 21:56:41,995 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:41,995 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:56:41,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:41,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:41,995 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:41,997 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:41,997 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:42,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:42,033 INFO L120 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 [2019-11-15 21:56:42,034 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:42,034 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:56:42,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:42,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:42,035 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:42,045 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:42,046 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:42,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:42,051 INFO L120 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 [2019-11-15 21:56:42,052 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:42,052 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:56:42,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:42,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:42,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:42,053 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:42,053 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:56:42,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:42,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:42,055 INFO L120 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 [2019-11-15 21:56:42,056 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:42,057 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:56:42,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:42,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:42,057 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:56:42,062 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:56:42,062 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:42,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:42,065 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:56:42,066 INFO L120 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 [2019-11-15 21:56:42,067 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:42,067 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:56:42,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:42,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:42,067 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:56:42,070 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-11-15 21:56:42,070 INFO L401 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-11-15 21:56:42,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:42,154 INFO L120 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 [2019-11-15 21:56:42,155 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:42,155 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:56:42,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:42,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:42,155 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:56:42,157 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-11-15 21:56:42,157 INFO L401 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-11-15 21:56:42,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:42,163 INFO L120 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 [2019-11-15 21:56:42,164 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:42,164 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:56:42,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:42,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:42,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:42,165 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:56:42,165 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:42,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:42,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:42,168 INFO L120 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 [2019-11-15 21:56:42,169 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:56:42,169 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:56:42,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:42,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:42,169 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:56:42,171 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-11-15 21:56:42,171 INFO L401 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-11-15 21:56:42,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:42,176 INFO L470 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2019-11-15 21:56:42,177 INFO L791 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 [2019-11-15 21:56:42,177 INFO L793 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 [2019-11-15 21:56:42,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:42,178 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 3 times [2019-11-15 21:56:42,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:42,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216929780] [2019-11-15 21:56:42,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:42,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:42,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:42,187 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:42,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 2 times [2019-11-15 21:56:42,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:42,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353631715] [2019-11-15 21:56:42,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:42,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:42,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:42,196 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1492334512, now seen corresponding path program 4 times [2019-11-15 21:56:42,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:42,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419688712] [2019-11-15 21:56:42,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:42,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:42,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:42,209 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:42,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:56:42 BoogieIcfgContainer [2019-11-15 21:56:42,275 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:56:42,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:56:42,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:56:42,276 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:56:42,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:39" (3/4) ... [2019-11-15 21:56:42,280 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 21:56:42,327 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_48df137f-8c82-407b-885b-5c95bf16eadc/bin/uautomizer/witness.graphml [2019-11-15 21:56:42,327 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:56:42,329 INFO L168 Benchmark]: Toolchain (without parser) took 3631.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -111.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:42,330 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:56:42,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:42,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:56:42,331 INFO L168 Benchmark]: Boogie Preprocessor took 18.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:56:42,332 INFO L168 Benchmark]: RCFGBuilder took 193.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:42,332 INFO L168 Benchmark]: BuchiAutomizer took 2969.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:42,333 INFO L168 Benchmark]: Witness Printer took 51.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:42,335 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2969.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * Witness Printer took 51.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 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 2.9s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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: 41ms 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...