./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.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_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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 c0afa1d46bded0eb2bd485bf4790c0d11468ed7a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:33:37,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:33:37,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:33:37,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:33:37,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:33:37,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:33:37,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:33:37,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:33:37,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:33:37,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:33:37,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:33:37,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:33:37,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:33:37,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:33:37,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:33:37,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:33:37,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:33:37,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:33:37,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:33:37,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:33:37,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:33:37,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:33:37,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:33:37,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:33:37,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:33:37,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:33:37,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:33:37,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:33:37,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:33:37,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:33:37,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:33:37,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:33:37,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:33:37,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:33:37,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:33:37,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:33:37,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:33:37,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:33:37,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:33:37,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:33:37,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:33:37,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:33:37,123 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:33:37,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:33:37,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:33:37,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:33:37,124 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:33:37,125 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:33:37,125 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:33:37,125 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:33:37,126 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:33:37,126 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:33:37,127 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:33:37,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:33:37,128 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:33:37,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:33:37,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:33:37,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:33:37,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:33:37,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:33:37,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:33:37,129 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:33:37,129 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:33:37,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:33:37,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:33:37,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:33:37,130 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:33:37,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:33:37,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:33:37,131 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:33:37,132 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:33:37,132 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_e904a999-e006-4c43-bd94-437811e9bfac/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 -> c0afa1d46bded0eb2bd485bf4790c0d11468ed7a [2019-11-16 00:33:37,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:33:37,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:33:37,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:33:37,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:33:37,174 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:33:37,175 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2019-11-16 00:33:37,224 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/data/57f616587/79c4680ea6d341ae83f44c2efd2f35e9/FLAG2eea5c350 [2019-11-16 00:33:37,618 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:33:37,619 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2019-11-16 00:33:37,625 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/data/57f616587/79c4680ea6d341ae83f44c2efd2f35e9/FLAG2eea5c350 [2019-11-16 00:33:37,641 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/data/57f616587/79c4680ea6d341ae83f44c2efd2f35e9 [2019-11-16 00:33:37,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:33:37,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:33:37,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:33:37,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:33:37,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:33:37,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:33:37" (1/1) ... [2019-11-16 00:33:37,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c06bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:37, skipping insertion in model container [2019-11-16 00:33:37,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:33:37" (1/1) ... [2019-11-16 00:33:37,662 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:33:37,679 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:33:37,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:33:37,970 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:33:37,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:33:38,004 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:33:38,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38 WrapperNode [2019-11-16 00:33:38,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:33:38,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:33:38,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:33:38,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:33:38,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:33:38,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:33:38,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:33:38,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:33:38,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... [2019-11-16 00:33:38,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:33:38,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:33:38,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:33:38,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:33:38,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:33:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:33:38,312 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:33:38,312 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-16 00:33:38,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:33:38 BoogieIcfgContainer [2019-11-16 00:33:38,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:33:38,314 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:33:38,314 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:33:38,318 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:33:38,319 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:33:38,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:33:37" (1/3) ... [2019-11-16 00:33:38,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f7debc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:33:38, skipping insertion in model container [2019-11-16 00:33:38,321 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:33:38,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:38" (2/3) ... [2019-11-16 00:33:38,321 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f7debc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:33:38, skipping insertion in model container [2019-11-16 00:33:38,321 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:33:38,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:33:38" (3/3) ... [2019-11-16 00:33:38,325 INFO L371 chiAutomizerObserver]: Analyzing ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2019-11-16 00:33:38,386 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:33:38,386 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:33:38,386 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:33:38,386 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:33:38,387 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:33:38,387 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:33:38,387 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:33:38,388 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:33:38,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-16 00:33:38,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:33:38,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:38,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:38,424 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:33:38,424 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:33:38,424 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:33:38,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-16 00:33:38,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:33:38,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:38,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:38,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:33:38,426 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:33:38,434 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 4#L21true assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 10#L22-2true [2019-11-16 00:33:38,434 INFO L793 eck$LassoCheckResult]: Loop: 10#L22-2true assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 7#L24-2true assume !(main_~y~0 < main_~z~0); 5#L24-3true main_~y~0 := main_~x~0 + main_~y~0; 10#L22-2true [2019-11-16 00:33:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:38,443 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-11-16 00:33:38,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:38,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656251614] [2019-11-16 00:33:38,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:38,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:38,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:38,530 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:38,532 INFO L82 PathProgramCache]: Analyzing trace with hash 42930, now seen corresponding path program 1 times [2019-11-16 00:33:38,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:38,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116761511] [2019-11-16 00:33:38,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:38,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:38,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:38,545 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:38,547 INFO L82 PathProgramCache]: Analyzing trace with hash 29684975, now seen corresponding path program 1 times [2019-11-16 00:33:38,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:38,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544526349] [2019-11-16 00:33:38,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:38,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:38,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:38,573 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:38,631 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:38,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:38,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:38,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:38,633 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:38,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:38,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:38,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:38,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration1_Loop [2019-11-16 00:33:38,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:38,634 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:38,655 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-16 00:33:38,666 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-16 00:33:38,671 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-16 00:33:38,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:38,781 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:38,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:38,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:38,801 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:38,801 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_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:38,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:38,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:38,820 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:38,820 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_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:38,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:38,829 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:38,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:38,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:41,026 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:41,028 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:41,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:41,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:41,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:41,029 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:41,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:41,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:41,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:41,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration1_Loop [2019-11-16 00:33:41,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:41,029 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:41,031 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-16 00:33:41,039 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-16 00:33:41,046 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-16 00:33:41,159 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:41,163 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:41,165 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-16 00:33:41,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:41,166 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:41,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:41,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:41,170 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:41,171 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:41,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:41,179 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-16 00:33:41,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:41,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:41,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:41,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:41,183 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:41,183 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:41,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:41,192 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-16 00:33:41,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:41,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:41,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:41,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:41,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:41,197 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:41,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:41,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:41,212 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-16 00:33:41,212 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-16 00:33:41,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:41,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:41,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:41,214 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:33:41,217 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:33:41,217 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-16 00:33:41,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:41,222 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-16 00:33:41,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:41,223 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:41,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:41,224 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:33:41,226 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:33:41,227 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-16 00:33:41,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:41,238 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-16 00:33:41,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:41,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:41,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:41,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:41,240 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:33:41,242 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:33:41,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:41,256 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:41,286 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:33:41,286 INFO L444 ModelExtractionUtils]: 4 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:33:41,288 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:41,288 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:41,289 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:41,289 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-16 00:33:41,292 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:41,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:41,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:41,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:33:41,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:41,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:41,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:41,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:41,430 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-16 00:33:41,445 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:33:41,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 3 states. [2019-11-16 00:33:41,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 3 states. Result 34 states and 47 transitions. Complement of second has 8 states. [2019-11-16 00:33:41,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:33:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:33:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-16 00:33:41,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-16 00:33:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-16 00:33:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-16 00:33:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:41,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-11-16 00:33:41,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:33:41,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 10 states and 14 transitions. [2019-11-16 00:33:41,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-16 00:33:41,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:33:41,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2019-11-16 00:33:41,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:41,526 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-11-16 00:33:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2019-11-16 00:33:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:33:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:33:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-11-16 00:33:41,551 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-11-16 00:33:41,552 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-11-16 00:33:41,552 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:33:41,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2019-11-16 00:33:41,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:33:41,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:41,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:41,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:33:41,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:33:41,554 INFO L791 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 93#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 94#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 96#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 97#L24-2 [2019-11-16 00:33:41,554 INFO L793 eck$LassoCheckResult]: Loop: 97#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 97#L24-2 [2019-11-16 00:33:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2019-11-16 00:33:41,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:41,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608189166] [2019-11-16 00:33:41,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:41,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:41,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:41,567 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2019-11-16 00:33:41,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:41,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543723816] [2019-11-16 00:33:41,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:41,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:41,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:41,575 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:41,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:41,575 INFO L82 PathProgramCache]: Analyzing trace with hash 29685033, now seen corresponding path program 2 times [2019-11-16 00:33:41,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:41,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116979243] [2019-11-16 00:33:41,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:41,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:41,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:41,589 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:41,607 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:41,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:41,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:41,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:41,608 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:41,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:41,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:41,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:41,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration2_Loop [2019-11-16 00:33:41,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:41,608 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:41,610 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-16 00:33:41,613 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-16 00:33:41,617 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-16 00:33:41,623 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-16 00:33:41,690 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:41,690 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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) [2019-11-16 00:33:41,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:41,703 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:41,709 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:41,709 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_e904a999-e006-4c43-bd94-437811e9bfac/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) [2019-11-16 00:33:41,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:41,729 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:41,733 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:41,733 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:41,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:41,752 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:41,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:41,772 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-16 00:33:41,947 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:41,949 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:41,949 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:41,949 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:41,949 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:41,949 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:41,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:41,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:41,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:41,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration2_Loop [2019-11-16 00:33:41,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:41,949 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:41,950 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-16 00:33:41,954 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-16 00:33:41,964 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-16 00:33:41,976 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-16 00:33:42,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:42,035 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:42,035 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-16 00:33:42,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:42,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:42,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:42,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:42,044 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:42,044 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:42,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33: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-16 00:33:42,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:42,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:42,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:42,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:42,058 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:42,058 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:42,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:42,071 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-16 00:33:42,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:42,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:42,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:42,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:42,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:42,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:42,078 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:42,082 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:42,088 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:33:42,097 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:33:42,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:42,098 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:42,098 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:42,098 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2019-11-16 00:33:42,099 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:42,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:42,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:42,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:33:42,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:42,132 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-16 00:33:42,132 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-16 00:33:42,132 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand 2 states. [2019-11-16 00:33:42,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 6. Second operand 2 states. Result 17 states and 28 transitions. Complement of second has 6 states. [2019-11-16 00:33:42,148 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-16 00:33:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:33:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-16 00:33:42,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 1 letters. [2019-11-16 00:33:42,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:42,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 1 letters. [2019-11-16 00:33:42,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:42,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:33:42,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:42,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 28 transitions. [2019-11-16 00:33:42,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:33:42,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 19 transitions. [2019-11-16 00:33:42,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:33:42,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:33:42,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-16 00:33:42,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:42,152 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-16 00:33:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-16 00:33:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-16 00:33:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:33:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2019-11-16 00:33:42,156 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-11-16 00:33:42,156 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-11-16 00:33:42,157 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:33:42,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2019-11-16 00:33:42,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:33:42,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:42,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:42,163 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:33:42,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:33:42,163 INFO L791 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 156#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 157#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 161#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 163#L24-2 assume !(main_~y~0 < main_~z~0); 152#L24-3 [2019-11-16 00:33:42,163 INFO L793 eck$LassoCheckResult]: Loop: 152#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 153#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 159#L24-2 assume !(main_~y~0 < main_~z~0); 152#L24-3 [2019-11-16 00:33:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash 29685031, now seen corresponding path program 1 times [2019-11-16 00:33:42,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:42,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367305510] [2019-11-16 00:33:42,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:42,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:42,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:42,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash 55200, now seen corresponding path program 2 times [2019-11-16 00:33:42,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:42,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599454691] [2019-11-16 00:33:42,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:42,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:42,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:42,213 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash -416479046, now seen corresponding path program 1 times [2019-11-16 00:33:42,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:42,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699128466] [2019-11-16 00:33:42,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:42,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:42,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:42,235 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:42,252 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:42,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:42,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:42,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:42,252 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:42,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:42,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:42,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:42,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration3_Loop [2019-11-16 00:33:42,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:42,253 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:42,254 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-16 00:33:42,258 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-16 00:33:42,276 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-16 00:33:42,328 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:42,329 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:42,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:42,343 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 [2019-11-16 00:33:42,352 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:42,352 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_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:42,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:42,368 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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) [2019-11-16 00:33:42,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:42,395 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:44,647 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:44,649 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:44,649 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:44,649 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:44,649 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:44,649 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:44,649 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:44,649 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:44,650 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:44,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration3_Loop [2019-11-16 00:33:44,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:44,650 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:44,651 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-16 00:33:44,662 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-16 00:33:44,664 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-16 00:33:44,732 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:44,732 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:44,733 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-16 00:33:44,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:44,733 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:44,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:44,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:44,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:44,735 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:44,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:44,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:44,740 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-16 00:33:44,740 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:44,740 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:44,740 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:44,741 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:44,742 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:44,746 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:44,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:44,755 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-16 00:33:44,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:44,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:44,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:44,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:44,757 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:44,758 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:44,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:44,760 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-16 00:33:44,760 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-16 00:33:44,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:44,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:44,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:44,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:44,762 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:33:44,763 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:33:44,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:44,770 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:44,775 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:33:44,776 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:33:44,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:44,776 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:44,777 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:44,777 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:33:44,777 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:44,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:44,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:44,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:33:44,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:44,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:44,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:44,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:44,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:44,955 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-16 00:33:44,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:33:44,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-16 00:33:44,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 30 states and 45 transitions. Complement of second has 8 states. [2019-11-16 00:33:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:33:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:33:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-11-16 00:33:44,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-16 00:33:44,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:44,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-16 00:33:44,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:44,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-16 00:33:44,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:44,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2019-11-16 00:33:44,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:33:44,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 33 transitions. [2019-11-16 00:33:44,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:33:44,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:33:44,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2019-11-16 00:33:44,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:44,994 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-11-16 00:33:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2019-11-16 00:33:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-11-16 00:33:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:33:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-16 00:33:44,997 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-16 00:33:44,997 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-16 00:33:44,998 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:33:44,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-16 00:33:44,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:33:44,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:44,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:44,999 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-16 00:33:45,000 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:33:45,000 INFO L791 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 250#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 251#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 263#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 261#L24-2 assume !(main_~y~0 < main_~z~0); 247#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 248#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 259#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 258#L24-2 [2019-11-16 00:33:45,000 INFO L793 eck$LassoCheckResult]: Loop: 258#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 258#L24-2 [2019-11-16 00:33:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash -416479044, now seen corresponding path program 2 times [2019-11-16 00:33:45,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:45,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010257854] [2019-11-16 00:33:45,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,014 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2019-11-16 00:33:45,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:45,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754731589] [2019-11-16 00:33:45,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,021 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash -25948454, now seen corresponding path program 3 times [2019-11-16 00:33:45,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:45,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839295537] [2019-11-16 00:33:45,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,036 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:45,059 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:45,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:45,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:45,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:45,059 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:45,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:45,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:45,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration4_Loop [2019-11-16 00:33:45,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:45,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:45,061 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-16 00:33:45,064 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-16 00:33:45,070 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-16 00:33:45,073 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-16 00:33:45,126 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:45,126 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/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-16 00:33:45,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:45,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:45,143 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:45,144 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:45,167 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:45,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:45,370 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:45,372 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:45,372 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:45,372 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:45,372 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:45,372 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:45,372 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,372 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:45,372 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:45,373 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration4_Loop [2019-11-16 00:33:45,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:45,373 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:45,375 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-16 00:33:45,385 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-16 00:33:45,387 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-16 00:33:45,390 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-16 00:33:45,442 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:45,442 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:45,443 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-16 00:33:45,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:45,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:45,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:45,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:45,444 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:45,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:45,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:45,446 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:45,448 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:33:45,448 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:33:45,449 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:45,449 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:45,449 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:45,449 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~z~0 - 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-16 00:33:45,449 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:45,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:45,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:45,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:33:45,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:45,486 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-16 00:33:45,486 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-16 00:33:45,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-11-16 00:33:45,498 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 21 states and 30 transitions. Complement of second has 5 states. [2019-11-16 00:33:45,499 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-16 00:33:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:33:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-16 00:33:45,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2019-11-16 00:33:45,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:45,500 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:45,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:45,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:45,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:33:45,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:45,526 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-16 00:33:45,526 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-16 00:33:45,526 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-11-16 00:33:45,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 21 states and 30 transitions. Complement of second has 5 states. [2019-11-16 00:33:45,539 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-16 00:33:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:33:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-16 00:33:45,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2019-11-16 00:33:45,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:45,540 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:45,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:45,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:45,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:33:45,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:45,568 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-16 00:33:45,568 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-16 00:33:45,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-11-16 00:33:45,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 29 states and 45 transitions. Complement of second has 5 states. [2019-11-16 00:33:45,580 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-16 00:33:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:33:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-16 00:33:45,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 1 letters. [2019-11-16 00:33:45,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:45,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 1 letters. [2019-11-16 00:33:45,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:45,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-16 00:33:45,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:45,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 45 transitions. [2019-11-16 00:33:45,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:33:45,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2019-11-16 00:33:45,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:33:45,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:33:45,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-11-16 00:33:45,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:45,585 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-16 00:33:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-11-16 00:33:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-11-16 00:33:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:33:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-16 00:33:45,587 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-16 00:33:45,588 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-16 00:33:45,588 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:33:45,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-16 00:33:45,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:33:45,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:45,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:45,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-16 00:33:45,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:33:45,589 INFO L791 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 451#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 452#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 456#L24-2 assume !(main_~y~0 < main_~z~0); 449#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 450#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 454#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 455#L24-2 assume !(main_~y~0 < main_~z~0); 447#L24-3 [2019-11-16 00:33:45,590 INFO L793 eck$LassoCheckResult]: Loop: 447#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 448#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 459#L24-2 assume !(main_~y~0 < main_~z~0); 447#L24-3 [2019-11-16 00:33:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash -418159556, now seen corresponding path program 4 times [2019-11-16 00:33:45,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:45,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068101886] [2019-11-16 00:33:45,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,599 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:45,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,600 INFO L82 PathProgramCache]: Analyzing trace with hash 55200, now seen corresponding path program 3 times [2019-11-16 00:33:45,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:45,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485036896] [2019-11-16 00:33:45,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:45,605 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:45,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1986148987, now seen corresponding path program 5 times [2019-11-16 00:33:45,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:45,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895003004] [2019-11-16 00:33:45,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:45,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:45,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895003004] [2019-11-16 00:33:45,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123457347] [2019-11-16 00:33:45,691 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:45,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-16 00:33:45,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:33:45,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:33:45,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:45,759 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:45,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-16 00:33:45,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581631997] [2019-11-16 00:33:45,783 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:45,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:45,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:45,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:45,783 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:45,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:45,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:45,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration5_Loop [2019-11-16 00:33:45,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:45,784 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:45,785 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-16 00:33:45,788 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-16 00:33:45,791 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-16 00:33:45,856 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:45,856 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:45,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:45,864 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:45,864 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:45,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:45,872 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:45,872 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:45,878 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:45,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:45,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:48,068 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:48,070 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:48,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:48,070 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:48,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:48,070 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:48,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:48,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:48,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:48,071 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration5_Loop [2019-11-16 00:33:48,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:48,071 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:48,072 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-16 00:33:48,086 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-16 00:33:48,088 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-16 00:33:48,144 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:48,144 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:48,144 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-16 00:33:48,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:48,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:48,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:48,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:48,146 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:48,146 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:48,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:48,148 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-16 00:33:48,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:48,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:48,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:48,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:48,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:48,150 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:48,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:48,152 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-16 00:33:48,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:48,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:48,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:48,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:48,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:48,154 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:48,154 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:48,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:48,156 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-16 00:33:48,157 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-16 00:33:48,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:48,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:48,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:48,157 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:33:48,160 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:33:48,160 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-16 00:33:48,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:48,162 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-16 00:33:48,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:48,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:48,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:48,163 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:33:48,164 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:33:48,164 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-16 00:33:48,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:48,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-16 00:33:48,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:48,174 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:48,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:48,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:48,175 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:33:48,176 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:33:48,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:48,186 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:48,197 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:33:48,198 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:33:48,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:48,198 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:48,199 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:48,199 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-16 00:33:48,199 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:48,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:48,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:48,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:33:48,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:48,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,354 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-16 00:33:48,354 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:33:48,354 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-16 00:33:48,377 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 26 states and 37 transitions. Complement of second has 7 states. [2019-11-16 00:33:48,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:33:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:33:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-16 00:33:48,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-16 00:33:48,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:48,381 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:48,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:48,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:48,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:48,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:33:48,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:48,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,510 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-16 00:33:48,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:33:48,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-16 00:33:48,538 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 24 states and 32 transitions. Complement of second has 7 states. [2019-11-16 00:33:48,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:33:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:33:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-11-16 00:33:48,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-16 00:33:48,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:48,540 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:48,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:48,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:48,563 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:33:48,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:48,641 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-16 00:33:48,642 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 3 loop predicates [2019-11-16 00:33:48,642 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-16 00:33:48,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 31 states and 43 transitions. Complement of second has 6 states. [2019-11-16 00:33:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:33:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:33:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:33:48,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-16 00:33:48,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:48,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-16 00:33:48,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:48,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-16 00:33:48,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:48,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions. [2019-11-16 00:33:48,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:33:48,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 24 states and 34 transitions. [2019-11-16 00:33:48,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:33:48,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:33:48,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2019-11-16 00:33:48,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:48,667 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-16 00:33:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2019-11-16 00:33:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-16 00:33:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:33:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-11-16 00:33:48,669 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-16 00:33:48,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:48,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:33:48,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:33:48,673 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand 8 states. [2019-11-16 00:33:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:48,807 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-11-16 00:33:48,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:33:48,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-16 00:33:48,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:33:48,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 28 transitions. [2019-11-16 00:33:48,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:33:48,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:33:48,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-16 00:33:48,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:48,810 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-16 00:33:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-16 00:33:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-11-16 00:33:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:33:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-16 00:33:48,811 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:33:48,811 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:33:48,812 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:33:48,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-16 00:33:48,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:33:48,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:48,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:48,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-16 00:33:48,813 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:33:48,813 INFO L791 eck$LassoCheckResult]: Stem: 784#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 782#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 783#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 787#L24-2 assume !(main_~y~0 < main_~z~0); 795#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 794#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 793#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 791#L24-2 assume !(main_~y~0 < main_~z~0); 778#L24-3 [2019-11-16 00:33:48,813 INFO L793 eck$LassoCheckResult]: Loop: 778#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 779#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 789#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 791#L24-2 assume !(main_~y~0 < main_~z~0); 778#L24-3 [2019-11-16 00:33:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash -418159556, now seen corresponding path program 6 times [2019-11-16 00:33:48,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:48,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488619928] [2019-11-16 00:33:48,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:48,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:48,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:48,824 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1711282, now seen corresponding path program 1 times [2019-11-16 00:33:48,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:48,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561531729] [2019-11-16 00:33:48,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:48,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:48,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:48,831 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1441076371, now seen corresponding path program 7 times [2019-11-16 00:33:48,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:48,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295497560] [2019-11-16 00:33:48,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:48,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:48,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:48,844 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:48,874 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:48,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:48,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:48,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:48,874 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:48,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:48,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:48,875 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:48,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration6_Loop [2019-11-16 00:33:48,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:48,875 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:48,876 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-16 00:33:48,883 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-16 00:33:48,887 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-16 00:33:49,007 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:49,007 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:49,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:49,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:49,035 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:49,035 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:49,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:49,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:49,054 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:49,054 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:49,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:49,060 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e904a999-e006-4c43-bd94-437811e9bfac/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:49,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:49,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:49,624 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:49,627 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:49,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:49,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:49,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:49,627 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:49,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:49,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:49,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:49,628 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration6_Loop [2019-11-16 00:33:49,628 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:49,628 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:49,628 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-16 00:33:49,637 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-16 00:33:49,640 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-16 00:33:49,711 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:49,711 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:49,711 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-16 00:33:49,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:49,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:49,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:49,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:49,713 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:49,713 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:49,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:49,715 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-16 00:33:49,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:49,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:49,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:49,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:49,717 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:49,717 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:49,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:49,718 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-16 00:33:49,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:49,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:49,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:49,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:49,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:49,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:49,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:49,722 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:49,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:33:49,724 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:33:49,725 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:49,725 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:49,725 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:49,725 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2019-11-16 00:33:49,725 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:49,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:49,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:49,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:33:49,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:49,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:33:49,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-16 00:33:49,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 35 states and 50 transitions. Complement of second has 6 states. [2019-11-16 00:33:49,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:33:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:33:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-16 00:33:49,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:33:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:49,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-16 00:33:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:49,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-16 00:33:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:49,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-11-16 00:33:49,800 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:33:49,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-11-16 00:33:49,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:33:49,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:33:49,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:33:49,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:33:49,801 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:49,801 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:49,801 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:49,801 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:33:49,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:33:49,801 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:33:49,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:33:49,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:33:49 BoogieIcfgContainer [2019-11-16 00:33:49,807 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:33:49,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:33:49,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:33:49,808 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:33:49,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:33:38" (3/4) ... [2019-11-16 00:33:49,811 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:33:49,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:33:49,813 INFO L168 Benchmark]: Toolchain (without parser) took 12167.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.8 MB in the beginning and 874.6 MB in the end (delta: 65.2 MB). Peak memory consumption was 212.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:49,814 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:49,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -201.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:49,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.68 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-16 00:33:49,815 INFO L168 Benchmark]: Boogie Preprocessor took 26.09 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-16 00:33:49,816 INFO L168 Benchmark]: RCFGBuilder took 250.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:49,816 INFO L168 Benchmark]: BuchiAutomizer took 11492.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.6 MB in the end (delta: 248.8 MB). Peak memory consumption was 248.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:49,817 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 1.2 GB. Free memory is still 874.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:49,819 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -201.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.68 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 26.09 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 250.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11492.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.6 MB in the end (delta: 248.8 MB). Peak memory consumption was 248.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.12 ms. Allocated memory is still 1.2 GB. Free memory is still 874.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y) and consists of 5 locations. One deterministic module has affine ranking function -1 * y + z and consists of 4 locations. One deterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y + x) and consists of 5 locations. One deterministic module has affine ranking function z and consists of 4 locations. One nondeterministic module has affine ranking function z + -1 * y and consists of 4 locations. One nondeterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else x + y) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 10.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 66 SDtfs, 68 SDslu, 8 SDs, 0 SdLazy, 143 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf97 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp97 dnf100 smp100 tf109 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...