./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.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/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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 687269bb6882b72a3d48999f1e5c55a1d5283a94 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:43,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:43,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:43,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:43,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:43,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:43,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:43,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:43,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:43,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:43,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:43,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:43,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:43,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:43,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:43,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:43,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:43,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:43,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:43,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:43,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:43,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:43,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:43,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:43,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:43,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:43,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:43,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:43,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:43,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:43,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:43,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:43,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:43,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:43,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:43,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:43,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:43,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:43,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:43,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:43,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:43,526 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:01:43,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:43,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:43,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:43,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:43,545 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:43,545 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:43,545 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:43,545 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:43,546 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:43,546 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:43,546 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:43,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:43,546 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:43,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:43,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:43,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:43,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:43,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:43,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:43,547 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:43,548 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:43,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:43,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:43,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:43,550 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:43,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:43,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:43,550 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:43,552 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:43,552 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/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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 -> 687269bb6882b72a3d48999f1e5c55a1d5283a94 [2019-10-22 09:01:43,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:43,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:43,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:43,598 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:43,598 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:43,599 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c [2019-10-22 09:01:43,646 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/data/ec1bff4de/f8688b2eb8284a2f9cbb48eb40512b4a/FLAG6e5b9d43f [2019-10-22 09:01:44,033 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:44,034 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c [2019-10-22 09:01:44,040 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/data/ec1bff4de/f8688b2eb8284a2f9cbb48eb40512b4a/FLAG6e5b9d43f [2019-10-22 09:01:44,051 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/data/ec1bff4de/f8688b2eb8284a2f9cbb48eb40512b4a [2019-10-22 09:01:44,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:44,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:44,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:44,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:44,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:44,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f4274c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44, skipping insertion in model container [2019-10-22 09:01:44,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,072 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:44,087 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:44,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:44,284 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:44,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:44,392 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:44,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44 WrapperNode [2019-10-22 09:01:44,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:44,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:44,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:44,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:44,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:44,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:44,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:44,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:44,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:44,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:44,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:44,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:44,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:44,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:44,626 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:44,626 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:01:44,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:44 BoogieIcfgContainer [2019-10-22 09:01:44,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:44,628 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:44,629 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:44,632 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:44,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:44,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:44" (1/3) ... [2019-10-22 09:01:44,635 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64f4cbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:44, skipping insertion in model container [2019-10-22 09:01:44,635 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:44,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44" (2/3) ... [2019-10-22 09:01:44,635 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64f4cbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:44, skipping insertion in model container [2019-10-22 09:01:44,635 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:44,636 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:44" (3/3) ... [2019-10-22 09:01:44,637 INFO L371 chiAutomizerObserver]: Analyzing ICFG TelAviv-Amir-Minimum.c [2019-10-22 09:01:44,709 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:44,709 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:44,709 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:44,710 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:44,710 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:44,710 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:44,710 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:44,710 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:44,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 09:01:44,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:44,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:44,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:44,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:44,796 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:44,796 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:44,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 09:01:44,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:44,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:44,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:44,798 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:44,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:44,820 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L25-2true [2019-10-22 09:01:44,820 INFO L793 eck$LassoCheckResult]: Loop: 8#L25-2true assume !!(main_~x~0 > 0 && main_~y~0 > 0); 12#L25true assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4#L26true assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 10#L26-2true main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8#L25-2true [2019-10-22 09:01:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-10-22 09:01:44,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732861886] [2019-10-22 09:01:44,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,943 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1234440, now seen corresponding path program 1 times [2019-10-22 09:01:44,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652091366] [2019-10-22 09:01:44,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,965 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash 29863591, now seen corresponding path program 1 times [2019-10-22 09:01:44,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956387251] [2019-10-22 09:01:44,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:45,044 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:45,044 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:45,045 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:45,045 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:45,045 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:45,045 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:45,045 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:45,045 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:45,045 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration1_Loop [2019-10-22 09:01:45,045 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:45,046 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:45,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,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-10-22 09:01:45,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,169 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:45,170 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:45,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:45,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:45,189 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:45,190 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/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:45,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:45,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:45,201 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:45,201 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/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:45,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:45,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:45,212 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:45,212 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:45,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:45,229 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:45,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:45,244 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-10-22 09:01:45,274 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:45,277 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:45,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:45,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:45,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:45,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:45,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:45,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:45,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:45,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration1_Loop [2019-10-22 09:01:45,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:45,278 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:45,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,389 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:45,396 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:45,398 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-10-22 09:01:45,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:45,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:45,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:45,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:45,405 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:45,407 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:45,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:45,422 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-10-22 09:01:45,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:45,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:45,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:45,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:45,426 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:45,430 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:45,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:45,456 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-10-22 09:01:45,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:45,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:45,458 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:45,458 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:45,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:45,459 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:45,459 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:45,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:45,470 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-10-22 09:01:45,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:45,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:45,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:45,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:45,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:45,473 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:45,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:45,491 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:45,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:45,510 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:45,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:45,512 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:45,512 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:45,513 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 09:01:45,516 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,562 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:45,626 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-10-22 09:01:45,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-10-22 09:01:45,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 40 states and 55 transitions. Complement of second has 8 states. [2019-10-22 09:01:45,694 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-10-22 09:01:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-10-22 09:01:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 4 letters. [2019-10-22 09:01:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:01:45,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 8 letters. [2019-10-22 09:01:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:45,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. [2019-10-22 09:01:45,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:01:45,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 21 states and 30 transitions. [2019-10-22 09:01:45,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 09:01:45,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:01:45,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-10-22 09:01:45,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:45,713 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 09:01:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-10-22 09:01:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-10-22 09:01:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:01:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-10-22 09:01:45,743 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:01:45,744 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:01:45,744 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:45,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-10-22 09:01:45,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:01:45,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:45,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:45,745 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:45,745 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:45,746 INFO L791 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 103#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 106#L25 [2019-10-22 09:01:45,746 INFO L793 eck$LassoCheckResult]: Loop: 106#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 97#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 98#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 105#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 106#L25 [2019-10-22 09:01:45,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-10-22 09:01:45,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257949955] [2019-10-22 09:01:45,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,758 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1328732, now seen corresponding path program 1 times [2019-10-22 09:01:45,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80315224] [2019-10-22 09:01:45,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,771 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash 925773253, now seen corresponding path program 1 times [2019-10-22 09:01:45,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946971517] [2019-10-22 09:01:45,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,784 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:45,813 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:45,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:45,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:45,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:45,813 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:45,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:45,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:45,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:45,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration2_Loop [2019-10-22 09:01:45,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:45,814 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:45,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,910 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:45,910 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:45,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:45,916 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-10-22 09:01:45,920 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:45,920 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/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:45,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:45,930 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/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:45,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:45,949 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-10-22 09:01:46,036 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:46,039 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:46,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:46,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:46,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:46,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:46,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:46,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:46,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:46,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration2_Loop [2019-10-22 09:01:46,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:46,040 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:46,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,161 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:46,161 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:46,161 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-10-22 09:01:46,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,165 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,165 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,169 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-10-22 09:01:46,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,170 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:46,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,170 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,171 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:46,171 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:46,180 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:46,185 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:46,186 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:46,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:46,186 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:46,186 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:46,187 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 09:01:46,187 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,223 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-10-22 09:01:46,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-10-22 09:01:46,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-10-22 09:01:46,277 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-10-22 09:01:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-10-22 09:01:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 09:01:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 09:01:46,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-10-22 09:01:46,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-10-22 09:01:46,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:46,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 21 states and 30 transitions. [2019-10-22 09:01:46,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:01:46,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:01:46,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-10-22 09:01:46,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:46,282 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 09:01:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-10-22 09:01:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-10-22 09:01:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:01:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-10-22 09:01:46,284 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-10-22 09:01:46,285 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-10-22 09:01:46,285 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:46,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-10-22 09:01:46,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:46,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:46,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:46,286 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:01:46,287 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:46,287 INFO L791 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 191#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 198#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 192#L33 [2019-10-22 09:01:46,287 INFO L793 eck$LassoCheckResult]: Loop: 192#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 184#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 185#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 199#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 192#L33 [2019-10-22 09:01:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 31084, now seen corresponding path program 1 times [2019-10-22 09:01:46,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477333932] [2019-10-22 09:01:46,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,298 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1696497, now seen corresponding path program 1 times [2019-10-22 09:01:46,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100965612] [2019-10-22 09:01:46,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,307 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1357271332, now seen corresponding path program 1 times [2019-10-22 09:01:46,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729572318] [2019-10-22 09:01:46,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,318 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,344 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:46,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:46,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:46,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:46,345 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:46,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:46,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:46,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:46,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration3_Loop [2019-10-22 09:01:46,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:46,346 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:46,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,435 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:46,435 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:46,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:46,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:46,450 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:46,451 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:46,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:46,462 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:46,466 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:46,467 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/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:46,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:46,475 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:46,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:46,489 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:46,600 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:46,602 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:46,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:46,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:46,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:46,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:46,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:46,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:46,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:46,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration3_Loop [2019-10-22 09:01:46,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:46,604 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:46,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,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-10-22 09:01:46,692 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:46,693 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:46,693 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-10-22 09:01:46,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,694 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:46,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,695 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:46,695 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:46,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,700 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-10-22 09:01:46,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,722 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-10-22 09:01:46,722 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,722 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:46,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,728 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:46,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:46,738 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:46,747 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:46,747 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:46,747 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:46,748 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:46,748 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:46,748 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-10-22 09:01:46,749 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,795 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-10-22 09:01:46,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 09:01:46,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 32 states and 48 transitions. Complement of second has 7 states. [2019-10-22 09:01:46,828 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-10-22 09:01:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 09:01:46,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2019-10-22 09:01:46,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 09:01:46,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 8 letters. [2019-10-22 09:01:46,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 48 transitions. [2019-10-22 09:01:46,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:46,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 38 transitions. [2019-10-22 09:01:46,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:01:46,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:01:46,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 38 transitions. [2019-10-22 09:01:46,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:46,841 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-10-22 09:01:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 38 transitions. [2019-10-22 09:01:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-22 09:01:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:01:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-10-22 09:01:46,847 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-10-22 09:01:46,847 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-10-22 09:01:46,847 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:46,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2019-10-22 09:01:46,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:46,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:46,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:46,849 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,849 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:46,849 INFO L791 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 291#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 298#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 292#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 283#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 284#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 302#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 285#L26 [2019-10-22 09:01:46,849 INFO L793 eck$LassoCheckResult]: Loop: 285#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 286#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 282#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 301#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 285#L26 [2019-10-22 09:01:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1357211759, now seen corresponding path program 1 times [2019-10-22 09:01:46,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566532061] [2019-10-22 09:01:46,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,870 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1419720, now seen corresponding path program 2 times [2019-10-22 09:01:46,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49174810] [2019-10-22 09:01:46,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,892 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,893 INFO L82 PathProgramCache]: Analyzing trace with hash -369493672, now seen corresponding path program 1 times [2019-10-22 09:01:46,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325158981] [2019-10-22 09:01:46,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,915 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,946 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:46,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:46,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:46,947 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:46,947 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:46,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:46,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:46,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:46,947 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration4_Loop [2019-10-22 09:01:46,947 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:46,947 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:46,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,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-10-22 09:01:46,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,030 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:47,030 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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) [2019-10-22 09:01:47,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:47,043 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:47,049 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:47,049 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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) [2019-10-22 09:01:47,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:47,058 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:47,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:47,071 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:47,209 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:47,210 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:47,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:47,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:47,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:47,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:47,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:47,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:47,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:47,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration4_Loop [2019-10-22 09:01:47,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:47,212 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:47,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,307 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:47,307 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:47,307 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-10-22 09:01:47,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,309 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:47,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,309 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:47,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,313 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-10-22 09:01:47,313 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,315 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:47,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,320 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:47,323 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:47,323 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:47,323 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:47,324 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:47,324 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:47,324 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 09:01:47,324 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,376 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-10-22 09:01:47,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 09:01:47,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 78 states and 116 transitions. Complement of second has 7 states. [2019-10-22 09:01:47,413 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-10-22 09:01:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-10-22 09:01:47,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 09:01:47,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:01:47,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 8 letters. [2019-10-22 09:01:47,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 116 transitions. [2019-10-22 09:01:47,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:01:47,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 55 states and 80 transitions. [2019-10-22 09:01:47,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 09:01:47,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 09:01:47,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 80 transitions. [2019-10-22 09:01:47,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:47,420 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-10-22 09:01:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 80 transitions. [2019-10-22 09:01:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-10-22 09:01:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 09:01:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2019-10-22 09:01:47,424 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2019-10-22 09:01:47,424 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2019-10-22 09:01:47,424 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:47,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 63 transitions. [2019-10-22 09:01:47,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:01:47,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:47,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:47,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,426 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:47,427 INFO L791 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 451#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 459#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 460#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 476#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 475#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 472#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 470#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 446#L26-2 [2019-10-22 09:01:47,427 INFO L793 eck$LassoCheckResult]: Loop: 446#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 482#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 465#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 445#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 446#L26-2 [2019-10-22 09:01:47,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,427 INFO L82 PathProgramCache]: Analyzing trace with hash 876108449, now seen corresponding path program 1 times [2019-10-22 09:01:47,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032135055] [2019-10-22 09:01:47,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,437 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1529372, now seen corresponding path program 2 times [2019-10-22 09:01:47,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507184845] [2019-10-22 09:01:47,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,444 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1432445116, now seen corresponding path program 1 times [2019-10-22 09:01:47,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966045288] [2019-10-22 09:01:47,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,455 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,486 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:47,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:47,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:47,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:47,487 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:47,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:47,487 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:47,487 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:47,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration5_Loop [2019-10-22 09:01:47,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:47,488 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:47,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:47,567 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:47,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:47,577 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:47,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:47,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:47,596 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:47,604 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:47,604 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:47,604 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:47,604 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:47,604 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:47,604 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:47,605 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:47,605 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:47,605 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration5_Loop [2019-10-22 09:01:47,605 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:47,605 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:47,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,662 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:47,662 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:47,662 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-10-22 09:01:47,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,663 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,664 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:47,664 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:47,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:47,667 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-10-22 09:01:47,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:47,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,671 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:47,673 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:47,674 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:47,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:47,674 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:47,674 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:47,674 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 09:01:47,675 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,703 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-10-22 09:01:47,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 63 transitions. cyclomatic complexity: 28 Second operand 4 states. [2019-10-22 09:01:47,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 63 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 106 states and 158 transitions. Complement of second has 7 states. [2019-10-22 09:01:47,720 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-10-22 09:01:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 09:01:47,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2019-10-22 09:01:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 09:01:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2019-10-22 09:01:47,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:47,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 158 transitions. [2019-10-22 09:01:47,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 09:01:47,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 90 states and 129 transitions. [2019-10-22 09:01:47,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-10-22 09:01:47,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-10-22 09:01:47,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 129 transitions. [2019-10-22 09:01:47,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:47,725 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 129 transitions. [2019-10-22 09:01:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 129 transitions. [2019-10-22 09:01:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2019-10-22 09:01:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 09:01:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2019-10-22 09:01:47,730 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2019-10-22 09:01:47,730 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2019-10-22 09:01:47,730 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:47,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. [2019-10-22 09:01:47,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 09:01:47,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:47,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:47,732 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,732 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:47,732 INFO L791 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 658#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 666#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 667#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 682#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 681#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 679#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 677#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 676#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 675#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 671#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 672#L33 [2019-10-22 09:01:47,732 INFO L793 eck$LassoCheckResult]: Loop: 672#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 721#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 719#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 718#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 672#L33 [2019-10-22 09:01:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash -369493663, now seen corresponding path program 2 times [2019-10-22 09:01:47,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302198379] [2019-10-22 09:01:47,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1696497, now seen corresponding path program 2 times [2019-10-22 09:01:47,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130785414] [2019-10-22 09:01:47,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,746 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash -4707247, now seen corresponding path program 1 times [2019-10-22 09:01:47,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856917927] [2019-10-22 09:01:47,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,775 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:47,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:47,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:47,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:47,775 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:47,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:47,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:47,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:47,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration6_Loop [2019-10-22 09:01:47,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:47,776 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:47,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,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-10-22 09:01:47,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,840 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:47,841 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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) [2019-10-22 09:01:47,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:47,845 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:47,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:47,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:47,917 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:47,919 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:47,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:47,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:47,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:47,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:47,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:47,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:47,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:47,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration6_Loop [2019-10-22 09:01:47,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:47,919 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:47,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:47,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:47,969 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:47,969 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-10-22 09:01:47,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:47,969 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:47,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:47,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:47,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:47,970 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:47,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:47,972 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:47,974 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:47,974 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:47,975 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:47,975 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:47,975 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:47,975 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-10-22 09:01:47,975 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:48,014 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-10-22 09:01:48,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2019-10-22 09:01:48,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 112 states and 173 transitions. Complement of second has 7 states. [2019-10-22 09:01:48,039 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-10-22 09:01:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 09:01:48,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:01:48,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:48,040 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:48,091 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-10-22 09:01:48,091 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2019-10-22 09:01:48,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 107 states and 160 transitions. Complement of second has 7 states. [2019-10-22 09:01:48,126 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-10-22 09:01:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 09:01:48,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:01:48,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:48,126 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:48,160 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-10-22 09:01:48,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2019-10-22 09:01:48,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 128 states and 203 transitions. Complement of second has 8 states. [2019-10-22 09:01:48,207 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-10-22 09:01:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-10-22 09:01:48,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:01:48,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:48,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:01:48,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:48,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 09:01:48,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:48,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 203 transitions. [2019-10-22 09:01:48,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2019-10-22 09:01:48,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 97 states and 147 transitions. [2019-10-22 09:01:48,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-10-22 09:01:48,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-10-22 09:01:48,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 147 transitions. [2019-10-22 09:01:48,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:48,214 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 147 transitions. [2019-10-22 09:01:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 147 transitions. [2019-10-22 09:01:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2019-10-22 09:01:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 09:01:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2019-10-22 09:01:48,219 INFO L711 BuchiCegarLoop]: Abstraction has 66 states and 100 transitions. [2019-10-22 09:01:48,219 INFO L591 BuchiCegarLoop]: Abstraction has 66 states and 100 transitions. [2019-10-22 09:01:48,219 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:48,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 100 transitions. [2019-10-22 09:01:48,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-10-22 09:01:48,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:48,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:48,224 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,224 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,224 INFO L791 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 1260#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1282#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1283#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 1286#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1285#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1268#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1261#L33 [2019-10-22 09:01:48,224 INFO L793 eck$LassoCheckResult]: Loop: 1261#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 1252#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1253#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1265#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1254#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1255#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1266#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1316#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1261#L33 [2019-10-22 09:01:48,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1365800207, now seen corresponding path program 1 times [2019-10-22 09:01:48,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755310998] [2019-10-22 09:01:48,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash -920272584, now seen corresponding path program 1 times [2019-10-22 09:01:48,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109016334] [2019-10-22 09:01:48,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,239 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash -725918680, now seen corresponding path program 1 times [2019-10-22 09:01:48,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403984215] [2019-10-22 09:01:48,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,260 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,306 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:48,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:48,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:48,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:48,306 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:48,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:48,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:48,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:48,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration7_Loop [2019-10-22 09:01:48,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:48,306 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:48,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,379 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:48,380 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:48,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:48,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:48,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:48,388 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:48,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:48,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:48,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:48,396 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:48,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:48,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:48,404 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:48,405 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/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-10-22 09:01:48,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:48,410 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:48,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:48,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:48,555 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:48,556 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:48,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:48,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:48,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:48,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:48,556 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:48,556 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:48,556 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:48,556 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration7_Loop [2019-10-22 09:01:48,556 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:48,557 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:48,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,606 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:48,606 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:48,606 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-10-22 09:01:48,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:48,607 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:48,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:48,607 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:48,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:48,607 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:48,607 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:48,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:48,609 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-10-22 09:01:48,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:48,609 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:48,609 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:48,609 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:48,610 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:48,610 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:48,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:48,611 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-10-22 09:01:48,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:48,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:48,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:48,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:48,617 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:48,617 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:48,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:48,618 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-10-22 09:01:48,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:48,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:48,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:48,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:48,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:48,620 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:48,620 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:48,623 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:48,625 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:48,626 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:48,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:48,626 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:48,626 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:48,626 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 09:01:48,627 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:48,678 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:01:48,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 100 transitions. cyclomatic complexity: 43 Second operand 5 states. [2019-10-22 09:01:48,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 100 transitions. cyclomatic complexity: 43. Second operand 5 states. Result 246 states and 366 transitions. Complement of second has 13 states. [2019-10-22 09:01:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2019-10-22 09:01:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 8 letters. [2019-10-22 09:01:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 15 letters. Loop has 8 letters. [2019-10-22 09:01:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 16 letters. [2019-10-22 09:01:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:48,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 366 transitions. [2019-10-22 09:01:48,764 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2019-10-22 09:01:48,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 208 states and 314 transitions. [2019-10-22 09:01:48,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-10-22 09:01:48,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-10-22 09:01:48,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 314 transitions. [2019-10-22 09:01:48,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:48,767 INFO L688 BuchiCegarLoop]: Abstraction has 208 states and 314 transitions. [2019-10-22 09:01:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 314 transitions. [2019-10-22 09:01:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 188. [2019-10-22 09:01:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-22 09:01:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2019-10-22 09:01:48,777 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2019-10-22 09:01:48,777 INFO L591 BuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2019-10-22 09:01:48,777 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:01:48,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 287 transitions. [2019-10-22 09:01:48,778 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2019-10-22 09:01:48,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:48,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:48,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,779 INFO L791 eck$LassoCheckResult]: Stem: 1652#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 1653#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1687#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1685#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 1683#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1682#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1680#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1675#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1676#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1782#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1778#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1771#L33 [2019-10-22 09:01:48,779 INFO L793 eck$LassoCheckResult]: Loop: 1771#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 1761#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1762#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1746#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1672#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1673#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1784#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1781#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1771#L33 [2019-10-22 09:01:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,780 INFO L82 PathProgramCache]: Analyzing trace with hash -369493663, now seen corresponding path program 3 times [2019-10-22 09:01:48,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152144387] [2019-10-22 09:01:48,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,789 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash -920272584, now seen corresponding path program 2 times [2019-10-22 09:01:48,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181992264] [2019-10-22 09:01:48,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,796 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash -742368616, now seen corresponding path program 2 times [2019-10-22 09:01:48,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084852034] [2019-10-22 09:01:48,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,808 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,864 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:48,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:48,865 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:48,865 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:48,865 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:48,865 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:48,865 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:48,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:48,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration8_Loop [2019-10-22 09:01:48,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:48,865 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:48,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,943 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:48,943 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:48,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:48,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:48,948 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:48,949 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:48,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:48,952 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:48,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:48,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:49,065 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:49,066 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:49,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:49,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:49,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:49,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:49,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:49,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:49,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:49,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration8_Loop [2019-10-22 09:01:49,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:49,067 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:49,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,137 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:49,137 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:49,138 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-10-22 09:01:49,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,139 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,139 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,142 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-10-22 09:01:49,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,143 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,143 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,146 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:49,148 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:49,148 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:49,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:49,149 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:49,149 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:49,149 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 09:01:49,149 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,196 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:01:49,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-10-22 09:01:49,267 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 330 states and 503 transitions. Complement of second has 13 states. [2019-10-22 09:01:49,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2019-10-22 09:01:49,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 09:01:49,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:49,268 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,318 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:01:49,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-10-22 09:01:49,410 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 326 states and 483 transitions. Complement of second has 15 states. [2019-10-22 09:01:49,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-10-22 09:01:49,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 09:01:49,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:49,413 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,460 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 4 loop predicates [2019-10-22 09:01:49,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-10-22 09:01:49,526 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 525 states and 786 transitions. Complement of second has 23 states. [2019-10-22 09:01:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-10-22 09:01:49,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 09:01:49,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:49,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 19 letters. Loop has 8 letters. [2019-10-22 09:01:49,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:49,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 16 letters. [2019-10-22 09:01:49,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:49,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 786 transitions. [2019-10-22 09:01:49,537 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2019-10-22 09:01:49,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 342 states and 512 transitions. [2019-10-22 09:01:49,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-10-22 09:01:49,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2019-10-22 09:01:49,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 512 transitions. [2019-10-22 09:01:49,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:49,546 INFO L688 BuchiCegarLoop]: Abstraction has 342 states and 512 transitions. [2019-10-22 09:01:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 512 transitions. [2019-10-22 09:01:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 205. [2019-10-22 09:01:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-22 09:01:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2019-10-22 09:01:49,561 INFO L711 BuchiCegarLoop]: Abstraction has 205 states and 317 transitions. [2019-10-22 09:01:49,561 INFO L591 BuchiCegarLoop]: Abstraction has 205 states and 317 transitions. [2019-10-22 09:01:49,561 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:01:49,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 317 transitions. [2019-10-22 09:01:49,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2019-10-22 09:01:49,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:49,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:49,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-10-22 09:01:49,564 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:49,564 INFO L791 eck$LassoCheckResult]: Stem: 3285#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 3286#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3327#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 3328#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 3362#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3335#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3299#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 3300#L33 [2019-10-22 09:01:49,564 INFO L793 eck$LassoCheckResult]: Loop: 3300#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 3421#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3422#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3412#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 3414#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 3470#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3469#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3415#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 3300#L33 [2019-10-22 09:01:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1365800207, now seen corresponding path program 2 times [2019-10-22 09:01:49,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538371322] [2019-10-22 09:01:49,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,571 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1729619210, now seen corresponding path program 1 times [2019-10-22 09:01:49,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816507944] [2019-10-22 09:01:49,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,581 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:49,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1535265306, now seen corresponding path program 1 times [2019-10-22 09:01:49,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322895629] [2019-10-22 09:01:49,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,598 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:49,643 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:49,643 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:49,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:49,643 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:49,643 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:49,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:49,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:49,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:49,644 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration9_Loop [2019-10-22 09:01:49,644 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:49,644 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:49,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,721 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:49,721 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:49,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:49,725 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:49,729 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:49,730 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:49,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:49,737 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:49,741 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:49,741 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:49,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:49,753 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:49,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:49,764 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:49,839 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:49,840 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:49,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:49,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:49,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:49,841 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:49,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:49,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:49,841 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:49,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration9_Loop [2019-10-22 09:01:49,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:49,841 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:49,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,910 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:49,910 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:49,910 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-10-22 09:01:49,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,912 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,912 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:49,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,915 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,915 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:49,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,915 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:49,916 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,918 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-10-22 09:01:49,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,919 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,919 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,920 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,923 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:49,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:49,925 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:49,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:49,926 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:49,926 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:49,926 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 09:01:49,926 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:01:49,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 205 states and 317 transitions. cyclomatic complexity: 133 Second operand 5 states. [2019-10-22 09:01:50,045 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 205 states and 317 transitions. cyclomatic complexity: 133. Second operand 5 states. Result 490 states and 759 transitions. Complement of second has 12 states. [2019-10-22 09:01:50,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2019-10-22 09:01:50,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 8 letters. [2019-10-22 09:01:50,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:50,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 15 letters. Loop has 8 letters. [2019-10-22 09:01:50,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:50,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 16 letters. [2019-10-22 09:01:50,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:50,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 759 transitions. [2019-10-22 09:01:50,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:01:50,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 285 states and 426 transitions. [2019-10-22 09:01:50,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 09:01:50,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 09:01:50,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 426 transitions. [2019-10-22 09:01:50,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:50,057 INFO L688 BuchiCegarLoop]: Abstraction has 285 states and 426 transitions. [2019-10-22 09:01:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 426 transitions. [2019-10-22 09:01:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 193. [2019-10-22 09:01:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-22 09:01:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 295 transitions. [2019-10-22 09:01:50,092 INFO L711 BuchiCegarLoop]: Abstraction has 193 states and 295 transitions. [2019-10-22 09:01:50,092 INFO L591 BuchiCegarLoop]: Abstraction has 193 states and 295 transitions. [2019-10-22 09:01:50,092 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:01:50,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 295 transitions. [2019-10-22 09:01:50,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:50,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:50,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:50,094 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1] [2019-10-22 09:01:50,094 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:50,094 INFO L791 eck$LassoCheckResult]: Stem: 4063#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 4064#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4084#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4088#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4085#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4087#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4081#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 4082#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 4134#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 4131#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4128#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4130#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4141#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4140#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4137#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4079#L26 [2019-10-22 09:01:50,094 INFO L793 eck$LassoCheckResult]: Loop: 4079#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4074#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4075#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4078#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4079#L26 [2019-10-22 09:01:50,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash -725859107, now seen corresponding path program 1 times [2019-10-22 09:01:50,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:50,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844853223] [2019-10-22 09:01:50,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,106 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1479302, now seen corresponding path program 3 times [2019-10-22 09:01:50,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:50,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282089315] [2019-10-22 09:01:50,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,111 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,111 INFO L82 PathProgramCache]: Analyzing trace with hash -517142174, now seen corresponding path program 2 times [2019-10-22 09:01:50,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:50,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778338471] [2019-10-22 09:01:50,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,120 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:50,140 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:50,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:50,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:50,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:50,141 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:50,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:50,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:50,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:50,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration10_Loop [2019-10-22 09:01:50,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:50,141 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:50,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,194 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:50,194 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:50,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:50,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:50,200 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:50,200 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_19=0} Honda state: {v_rep~unnamed0~0~false_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:50,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:50,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:50,206 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:50,206 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_19=1} Honda state: {v_rep~unnamed0~0~true_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:50,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:50,210 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fcc7ff-4783-43ab-9034-6cc8a8631064/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:50,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:50,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:50,291 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:50,292 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:50,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:50,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:50,292 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:50,292 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:50,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:50,292 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:50,293 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:50,293 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration10_Loop [2019-10-22 09:01:50,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:50,293 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:50,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,344 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:50,344 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:50,345 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-10-22 09:01:50,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:50,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:50,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:50,345 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:50,346 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:50,346 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:50,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:50,347 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-10-22 09:01:50,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:50,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:50,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:50,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:50,350 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:50,350 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:50,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:50,352 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-10-22 09:01:50,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:50,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:50,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:50,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:50,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:50,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:50,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:50,356 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:50,358 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:50,358 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:50,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:50,359 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:50,359 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:50,359 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 09:01:50,359 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:50,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:50,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:50,401 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-10-22 09:01:50,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2019-10-22 09:01:50,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 302 states and 452 transitions. Complement of second has 7 states. [2019-10-22 09:01:50,428 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-10-22 09:01:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 09:01:50,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:01:50,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:50,429 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:50,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:50,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:50,468 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-10-22 09:01:50,468 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2019-10-22 09:01:50,490 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 313 states and 443 transitions. Complement of second has 7 states. [2019-10-22 09:01:50,490 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-10-22 09:01:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 09:01:50,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:01:50,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:50,491 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:50,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:50,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:50,524 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-10-22 09:01:50,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2019-10-22 09:01:50,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 423 states and 703 transitions. Complement of second has 8 states. [2019-10-22 09:01:50,545 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-10-22 09:01:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-10-22 09:01:50,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:01:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2019-10-22 09:01:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 8 letters. [2019-10-22 09:01:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:50,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 703 transitions. [2019-10-22 09:01:50,549 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:50,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 0 states and 0 transitions. [2019-10-22 09:01:50,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:50,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:50,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:50,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:50,550 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:50,550 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:50,550 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:50,550 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:01:50,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:50,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:50,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:01:50,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:50 BoogieIcfgContainer [2019-10-22 09:01:50,560 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:50,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:50,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:50,561 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:50,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:44" (3/4) ... [2019-10-22 09:01:50,568 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:50,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:50,570 INFO L168 Benchmark]: Toolchain (without parser) took 6514.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.2 MB). Free memory was 949.8 MB in the beginning and 1.2 GB in the end (delta: -213.7 MB). Peak memory consumption was 71.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:50,571 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:50,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 949.8 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:50,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.37 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-10-22 09:01:50,573 INFO L168 Benchmark]: Boogie Preprocessor took 16.12 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-10-22 09:01:50,574 INFO L168 Benchmark]: RCFGBuilder took 185.15 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:50,574 INFO L168 Benchmark]: BuchiAutomizer took 5931.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.4 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:50,574 INFO L168 Benchmark]: Witness Printer took 7.71 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:50,576 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 949.8 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.37 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 16.12 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 185.15 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5931.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.4 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. * Witness Printer took 7.71 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (0 trivial, 7 deterministic, 3 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 7 locations. One deterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 4.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 316 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 205 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 191 SDtfs, 249 SDslu, 111 SDs, 0 SdLazy, 311 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT10 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax150 hnf98 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp100 dnf100 smp100 tf107 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...