./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e334a37fa3ef1f2b757af8cdc97575f5cde09f8b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:21:16,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:21:16,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:21:16,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:21:16,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:21:16,491 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:21:16,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:21:16,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:21:16,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:21:16,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:21:16,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:21:16,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:21:16,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:21:16,497 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:21:16,498 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:21:16,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:21:16,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:21:16,500 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:21:16,502 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:21:16,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:21:16,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:21:16,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:21:16,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:21:16,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:21:16,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:21:16,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:21:16,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:21:16,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:21:16,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:21:16,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:21:16,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:21:16,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:21:16,510 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:21:16,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:21:16,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:21:16,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:21:16,512 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 01:21:16,523 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:21:16,523 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:21:16,524 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:21:16,524 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:21:16,524 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:21:16,524 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 01:21:16,524 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 01:21:16,524 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 01:21:16,525 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 01:21:16,525 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 01:21:16,525 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 01:21:16,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:21:16,525 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:21:16,525 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:21:16,525 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:21:16,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 01:21:16,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 01:21:16,526 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 01:21:16,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:21:16,526 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 01:21:16,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 01:21:16,527 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:21:16,527 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:21:16,527 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 01:21:16,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:21:16,529 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:21:16,529 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 01:21:16,530 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 01:21:16,530 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e334a37fa3ef1f2b757af8cdc97575f5cde09f8b [2018-11-10 01:21:16,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:21:16,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:21:16,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:21:16,564 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:21:16,564 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:21:16,564 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2018-11-10 01:21:16,597 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/data/5b392643f/97c8a05d989a41a9b7a24d7ba85feb99/FLAGf25a88bd2 [2018-11-10 01:21:16,989 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:21:16,990 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2018-11-10 01:21:16,993 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/data/5b392643f/97c8a05d989a41a9b7a24d7ba85feb99/FLAGf25a88bd2 [2018-11-10 01:21:17,002 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/data/5b392643f/97c8a05d989a41a9b7a24d7ba85feb99 [2018-11-10 01:21:17,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:21:17,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:21:17,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:21:17,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:21:17,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:21:17,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc2202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17, skipping insertion in model container [2018-11-10 01:21:17,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:21:17,027 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:21:17,111 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:21:17,113 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:21:17,122 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:21:17,130 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:21:17,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17 WrapperNode [2018-11-10 01:21:17,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:21:17,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:21:17,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:21:17,131 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:21:17,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:21:17,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:21:17,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:21:17,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:21:17,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... [2018-11-10 01:21:17,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:21:17,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:21:17,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:21:17,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:21:17,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:17,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:21:17,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:21:17,352 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:21:17,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:21:17 BoogieIcfgContainer [2018-11-10 01:21:17,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:21:17,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 01:21:17,353 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 01:21:17,356 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 01:21:17,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:21:17,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:21:17" (1/3) ... [2018-11-10 01:21:17,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ba68dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:21:17, skipping insertion in model container [2018-11-10 01:21:17,358 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:21:17,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:17" (2/3) ... [2018-11-10 01:21:17,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ba68dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:21:17, skipping insertion in model container [2018-11-10 01:21:17,358 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:21:17,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:21:17" (3/3) ... [2018-11-10 01:21:17,359 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2018-11-10 01:21:17,408 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:21:17,408 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 01:21:17,409 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 01:21:17,409 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 01:21:17,409 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:21:17,409 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:21:17,409 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 01:21:17,409 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:21:17,409 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 01:21:17,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-10 01:21:17,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:17,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:17,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:17,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:21:17,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:21:17,435 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 01:21:17,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-10 01:21:17,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:17,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:17,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:17,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:21:17,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:21:17,441 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 3#L18-3true [2018-11-10 01:21:17,441 INFO L795 eck$LassoCheckResult]: Loop: 3#L18-3true assume true; 6#L18-1true assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 9#L19true assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 8#L19-2true main_~y~0 := main_~y~0 - 1; 3#L18-3true [2018-11-10 01:21:17,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:17,445 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 01:21:17,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:17,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:17,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:17,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:17,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:17,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1114793, now seen corresponding path program 1 times [2018-11-10 01:21:17,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:17,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:17,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:17,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:17,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:17,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash 889541995, now seen corresponding path program 1 times [2018-11-10 01:21:17,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:17,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:17,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:17,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:17,577 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:17,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:17,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:17,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:17,578 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:17,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:17,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:17,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:17,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 01:21:17,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:17,579 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:17,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,708 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:17,709 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:17,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:17,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:17,733 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:17,734 INFO L446 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_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:17,737 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:17,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:17,753 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:17,753 INFO L446 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_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:17,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:17,757 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:17,775 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:17,775 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:17,792 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:17,793 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:17,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:17,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:17,794 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:17,794 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:17,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:17,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:17,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:17,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 01:21:17,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:17,794 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:17,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:17,860 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:17,863 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:17,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:17,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:17,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:17,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:17,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:17,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:21:17,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:21:17,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:17,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:17,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:17,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:17,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:17,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:17,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:21:17,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:21:17,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:17,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:17,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:17,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:17,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:17,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:17,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:17,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:21:17,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:17,892 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:17,896 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:17,896 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 01:21:17,898 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:17,898 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:17,898 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:17,899 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2018-11-10 01:21:17,900 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:17,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:17,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:17,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:17,965 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 01:21:17,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-10 01:21:17,999 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 46 states and 61 transitions. Complement of second has 8 states. [2018-11-10 01:21:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 01:21:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:21:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-10 01:21:18,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-10 01:21:18,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:18,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-10 01:21:18,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:18,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-10 01:21:18,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:18,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2018-11-10 01:21:18,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:18,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 21 states and 27 transitions. [2018-11-10 01:21:18,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 01:21:18,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 01:21:18,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-10 01:21:18,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:18,011 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-10 01:21:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-10 01:21:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 01:21:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 01:21:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-11-10 01:21:18,028 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-10 01:21:18,028 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-10 01:21:18,028 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 01:21:18,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-11-10 01:21:18,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:18,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:18,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:18,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:21:18,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 01:21:18,030 INFO L793 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 111#L18-3 assume true; 109#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 117#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 119#L20-3 assume true; 120#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 123#L20-3 [2018-11-10 01:21:18,030 INFO L795 eck$LassoCheckResult]: Loop: 123#L20-3 assume true; 124#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 123#L20-3 [2018-11-10 01:21:18,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1805982284, now seen corresponding path program 1 times [2018-11-10 01:21:18,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:18,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1575, now seen corresponding path program 1 times [2018-11-10 01:21:18,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:18,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash 382187954, now seen corresponding path program 2 times [2018-11-10 01:21:18,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,083 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:18,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:18,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:18,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:18,084 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:18,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:18,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:18,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 01:21:18,084 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:18,084 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:18,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,123 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:18,124 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:18,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:18,141 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:18,141 INFO L446 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_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:18,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:18,159 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:18,160 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:18,162 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:18,165 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:18,165 INFO L446 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_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:18,180 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:18,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:18,341 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:18,342 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:18,342 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:18,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:18,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:18,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:18,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,343 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:18,343 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:18,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 01:21:18,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:18,343 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:18,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,397 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:18,397 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:18,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:18,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:18,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:18,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:18,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:18,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:21:18,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:21:18,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:18,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:18,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:18,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:18,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:18,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:18,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:21:18,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:21:18,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:18,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:18,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:18,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:18,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:18,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:21:18,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:18,422 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:21:18,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:18,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:18,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:18,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:18,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:18,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:18,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:18,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:18,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:21:18,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:18,431 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:18,434 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:18,434 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 01:21:18,434 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:18,434 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:18,435 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:18,435 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~m~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~m~0 + 1 Supporting invariants [] [2018-11-10 01:21:18,435 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:18,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:18,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:18,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:18,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 01:21:18,472 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-10 01:21:18,486 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 36 states and 49 transitions. Complement of second has 6 states. [2018-11-10 01:21:18,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 01:21:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 01:21:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 01:21:18,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-10 01:21:18,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:18,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-10 01:21:18,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:18,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-10 01:21:18,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:18,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 49 transitions. [2018-11-10 01:21:18,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:18,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 27 states and 35 transitions. [2018-11-10 01:21:18,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 01:21:18,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 01:21:18,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-10 01:21:18,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:18,493 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-10 01:21:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-10 01:21:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-10 01:21:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 01:21:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-10 01:21:18,497 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-10 01:21:18,497 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-10 01:21:18,497 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 01:21:18,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-10 01:21:18,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:18,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:18,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:18,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:21:18,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 01:21:18,499 INFO L793 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 216#L18-3 assume true; 214#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 226#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 228#L20-3 assume true; 230#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 222#L20-3 assume true; 224#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 217#L20-4 [2018-11-10 01:21:18,499 INFO L795 eck$LassoCheckResult]: Loop: 217#L20-4 main_~x~0 := main_~x~0 - 1; 218#L19-2 main_~y~0 := main_~y~0 - 1; 210#L18-3 assume true; 211#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 232#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 233#L20-3 assume !true; 217#L20-4 [2018-11-10 01:21:18,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,502 INFO L82 PathProgramCache]: Analyzing trace with hash 382187952, now seen corresponding path program 1 times [2018-11-10 01:21:18,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:18,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:18,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:18,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1748416023, now seen corresponding path program 1 times [2018-11-10 01:21:18,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:18,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:18,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:21:18,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 01:21:18,531 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:21:18,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 01:21:18,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:21:18,535 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 2 states. [2018-11-10 01:21:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:21:18,538 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-11-10 01:21:18,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 01:21:18,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-11-10 01:21:18,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:18,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2018-11-10 01:21:18,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 01:21:18,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 01:21:18,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-10 01:21:18,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:18,540 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-10 01:21:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-10 01:21:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 01:21:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 01:21:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-11-10 01:21:18,543 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-10 01:21:18,543 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-10 01:21:18,543 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 01:21:18,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2018-11-10 01:21:18,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:18,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:18,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:18,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:21:18,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:21:18,544 INFO L793 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 271#L18-3 assume true; 269#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 286#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 287#L20-3 assume true; 284#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 285#L20-3 assume true; 280#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 272#L20-4 [2018-11-10 01:21:18,545 INFO L795 eck$LassoCheckResult]: Loop: 272#L20-4 main_~x~0 := main_~x~0 - 1; 273#L19-2 main_~y~0 := main_~y~0 - 1; 265#L18-3 assume true; 266#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 282#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 277#L20-3 assume true; 278#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 272#L20-4 [2018-11-10 01:21:18,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,546 INFO L82 PathProgramCache]: Analyzing trace with hash 382187952, now seen corresponding path program 2 times [2018-11-10 01:21:18,546 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:18,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1633678360, now seen corresponding path program 1 times [2018-11-10 01:21:18,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:18,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:18,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:18,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1716772697, now seen corresponding path program 1 times [2018-11-10 01:21:18,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:18,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:18,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:18,622 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:18,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:18,622 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:18,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:18,623 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:18,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:18,623 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:18,623 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 01:21:18,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:18,623 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:18,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,745 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:18,745 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:18,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:18,781 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:18,781 INFO L446 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_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:18,785 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:18,803 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:18,908 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:18,909 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:18,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:18,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:18,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:18,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:18,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:18,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:18,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:18,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 01:21:18,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:18,910 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:18,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:18,991 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:18,991 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:18,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:18,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:18,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:18,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:18,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:18,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:21:18,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:21:18,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:18,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:18,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:18,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:18,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:18,998 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:21:18,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:18,999 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:21:18,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:19,004 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:19,007 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:19,007 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 01:21:19,008 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:19,008 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:19,008 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:19,008 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 01:21:19,009 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:19,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:19,050 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 [2018-11-10 01:21:19,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 32 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-10 01:21:19,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 32 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 64 states and 81 transitions. Complement of second has 7 states. [2018-11-10 01:21:19,071 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 [2018-11-10 01:21:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 01:21:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-10 01:21:19,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 01:21:19,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-10 01:21:19,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 14 letters. [2018-11-10 01:21:19,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 81 transitions. [2018-11-10 01:21:19,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:19,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 50 states and 63 transitions. [2018-11-10 01:21:19,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 01:21:19,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 01:21:19,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 63 transitions. [2018-11-10 01:21:19,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:19,078 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-11-10 01:21:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 63 transitions. [2018-11-10 01:21:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-10 01:21:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 01:21:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-11-10 01:21:19,081 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-10 01:21:19,082 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-10 01:21:19,082 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 01:21:19,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2018-11-10 01:21:19,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:21:19,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:19,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:19,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 01:21:19,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:21:19,084 INFO L793 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 427#L18-3 assume true; 428#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 443#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 439#L20-3 assume true; 440#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 449#L20-4 main_~x~0 := main_~x~0 - 1; 464#L19-2 main_~y~0 := main_~y~0 - 1; 461#L18-3 assume true; 441#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 442#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 446#L20-3 assume true; 473#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 472#L20-3 assume true; 454#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 450#L20-4 [2018-11-10 01:21:19,084 INFO L795 eck$LassoCheckResult]: Loop: 450#L20-4 main_~x~0 := main_~x~0 - 1; 444#L19-2 main_~y~0 := main_~y~0 - 1; 445#L18-3 assume true; 453#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 451#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 448#L20-3 assume true; 471#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 450#L20-4 [2018-11-10 01:21:19,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1932927909, now seen corresponding path program 2 times [2018-11-10 01:21:19,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:19,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:21:19,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:21:19,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:21:19,103 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:21:19,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1633678360, now seen corresponding path program 2 times [2018-11-10 01:21:19,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:19,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:19,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:19,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,143 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:19,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:19,143 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:19,143 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:19,143 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:19,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:19,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:19,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 01:21:19,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:19,144 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:19,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,210 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:19,210 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:19,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:19,218 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:19,218 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=7} Honda state: {ULTIMATE.start_main_#t~nondet1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:19,234 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:19,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:19,362 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:19,363 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:19,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:19,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:19,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:19,363 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:19,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:19,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:19,364 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 01:21:19,364 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:19,364 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:19,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,418 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:19,418 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:19,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:19,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:19,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:19,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:19,419 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:21:19,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:19,419 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:21:19,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:19,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:19,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:19,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:19,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:19,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:19,424 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:21:19,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:19,425 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:21:19,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:19,428 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:19,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:19,430 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 01:21:19,430 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:19,430 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:19,431 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:19,431 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 01:21:19,431 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:19,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:19,464 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 [2018-11-10 01:21:19,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 60 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-10 01:21:19,479 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 60 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 68 states and 85 transitions. Complement of second has 7 states. [2018-11-10 01:21:19,479 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 [2018-11-10 01:21:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 01:21:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-10 01:21:19,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-10 01:21:19,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,480 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:21:19,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:19,518 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 [2018-11-10 01:21:19,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 60 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-10 01:21:19,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 60 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 98 states and 121 transitions. Complement of second has 9 states. [2018-11-10 01:21:19,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 01:21:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 01:21:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-10 01:21:19,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-10 01:21:19,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-10 01:21:19,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-10 01:21:19,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 121 transitions. [2018-11-10 01:21:19,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 01:21:19,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 93 states and 116 transitions. [2018-11-10 01:21:19,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 01:21:19,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 01:21:19,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 116 transitions. [2018-11-10 01:21:19,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:19,542 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 116 transitions. [2018-11-10 01:21:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 116 transitions. [2018-11-10 01:21:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-11-10 01:21:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 01:21:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2018-11-10 01:21:19,545 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-11-10 01:21:19,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:21:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:21:19,546 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand 4 states. [2018-11-10 01:21:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:21:19,558 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-10 01:21:19,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:21:19,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 82 transitions. [2018-11-10 01:21:19,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 01:21:19,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 65 transitions. [2018-11-10 01:21:19,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 01:21:19,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 01:21:19,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 65 transitions. [2018-11-10 01:21:19,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:19,560 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2018-11-10 01:21:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 65 transitions. [2018-11-10 01:21:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-10 01:21:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 01:21:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2018-11-10 01:21:19,563 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2018-11-10 01:21:19,563 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2018-11-10 01:21:19,563 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 01:21:19,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions. [2018-11-10 01:21:19,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 01:21:19,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:19,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:19,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 01:21:19,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:21:19,565 INFO L793 eck$LassoCheckResult]: Stem: 970#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 961#L18-3 assume true; 962#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 971#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 979#L20-3 assume true; 996#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 994#L20-3 assume true; 990#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 966#L20-4 main_~x~0 := main_~x~0 - 1; 968#L19-2 main_~y~0 := main_~y~0 - 1; 963#L18-3 assume true; 964#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 972#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 980#L20-3 [2018-11-10 01:21:19,565 INFO L795 eck$LassoCheckResult]: Loop: 980#L20-3 assume true; 981#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 973#L20-3 assume true; 974#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 984#L20-4 main_~x~0 := main_~x~0 - 1; 977#L19-2 main_~y~0 := main_~y~0 - 1; 978#L18-3 assume true; 1005#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1006#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 980#L20-3 [2018-11-10 01:21:19,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash -333408715, now seen corresponding path program 3 times [2018-11-10 01:21:19,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:19,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash 811118074, now seen corresponding path program 1 times [2018-11-10 01:21:19,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1888759226, now seen corresponding path program 4 times [2018-11-10 01:21:19,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:19,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,652 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:19,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:19,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:19,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:19,652 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:19,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:19,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:19,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 01:21:19,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:19,653 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:19,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,703 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:19,704 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:19,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:19,712 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:19,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:19,730 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:19,783 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:19,785 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:19,785 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:19,785 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:19,785 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:19,785 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:19,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:19,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:19,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 01:21:19,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:19,786 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:19,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,829 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:19,829 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:19,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:19,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:19,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:19,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:19,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:19,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:19,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:21:19,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:19,833 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:19,834 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:19,834 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 01:21:19,834 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:19,834 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:19,835 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:19,835 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 01:21:19,835 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:19,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:19,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:21:19,860 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 [2018-11-10 01:21:19,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 65 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-10 01:21:19,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 65 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 141 states and 182 transitions. Complement of second has 6 states. [2018-11-10 01:21:19,871 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 [2018-11-10 01:21:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 01:21:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 01:21:19,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-10 01:21:19,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 23 letters. Loop has 9 letters. [2018-11-10 01:21:19,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 14 letters. Loop has 18 letters. [2018-11-10 01:21:19,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:19,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 182 transitions. [2018-11-10 01:21:19,873 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-10 01:21:19,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 94 states and 123 transitions. [2018-11-10 01:21:19,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 01:21:19,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 01:21:19,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 123 transitions. [2018-11-10 01:21:19,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:19,876 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 123 transitions. [2018-11-10 01:21:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 123 transitions. [2018-11-10 01:21:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 65. [2018-11-10 01:21:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 01:21:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2018-11-10 01:21:19,880 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 87 transitions. [2018-11-10 01:21:19,880 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 87 transitions. [2018-11-10 01:21:19,880 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 01:21:19,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 87 transitions. [2018-11-10 01:21:19,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-10 01:21:19,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:19,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:19,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 01:21:19,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 01:21:19,882 INFO L793 eck$LassoCheckResult]: Stem: 1254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 1251#L18-3 assume true; 1269#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1268#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 1255#L20-3 assume true; 1256#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 1265#L20-3 assume true; 1285#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 1304#L20-4 main_~x~0 := main_~x~0 - 1; 1305#L19-2 main_~y~0 := main_~y~0 - 1; 1310#L18-3 assume true; 1309#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1308#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 1264#L20-3 [2018-11-10 01:21:19,882 INFO L795 eck$LassoCheckResult]: Loop: 1264#L20-3 assume true; 1263#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 1264#L20-3 [2018-11-10 01:21:19,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,882 INFO L82 PathProgramCache]: Analyzing trace with hash -333408715, now seen corresponding path program 5 times [2018-11-10 01:21:19,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:19,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1575, now seen corresponding path program 2 times [2018-11-10 01:21:19,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:19,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1716772699, now seen corresponding path program 6 times [2018-11-10 01:21:19,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:19,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:19,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:19,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:19,908 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:19,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:19,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:19,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:19,908 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:19,908 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,908 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:19,908 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:19,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 01:21:19,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:19,908 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:19,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:19,934 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:19,934 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:19,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:19,936 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:19,952 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:19,952 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:19,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:19,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:19,970 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:19,970 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:19,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:19,973 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:19,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:19,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:20,139 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:20,141 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:20,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:20,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:20,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:20,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:20,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:20,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:20,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:20,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 01:21:20,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:20,141 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:20,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,166 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:20,166 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:20,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:20,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:20,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:20,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:20,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:20,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:21:20,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:21:20,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:20,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:20,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:20,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:20,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:20,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:20,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:20,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:21:20,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:20,173 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:20,174 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:20,174 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 01:21:20,174 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:20,174 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:20,174 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:20,174 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~m~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~m~0 + 1 Supporting invariants [] [2018-11-10 01:21:20,174 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:20,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:20,192 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 01:21:20,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 87 transitions. cyclomatic complexity: 30 Second operand 3 states. [2018-11-10 01:21:20,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 87 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 74 states and 98 transitions. Complement of second has 5 states. [2018-11-10 01:21:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 01:21:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 01:21:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 01:21:20,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-10 01:21:20,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,199 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:21:20,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:20,224 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 01:21:20,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 87 transitions. cyclomatic complexity: 30 Second operand 3 states. [2018-11-10 01:21:20,240 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 87 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 74 states and 98 transitions. Complement of second has 5 states. [2018-11-10 01:21:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 01:21:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 01:21:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 01:21:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-10 01:21:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,241 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:21:20,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:20,257 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 01:21:20,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 87 transitions. cyclomatic complexity: 30 Second operand 3 states. [2018-11-10 01:21:20,264 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 87 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 92 states and 118 transitions. Complement of second has 4 states. [2018-11-10 01:21:20,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 01:21:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 01:21:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-10 01:21:20,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-10 01:21:20,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-10 01:21:20,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-10 01:21:20,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 118 transitions. [2018-11-10 01:21:20,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:21:20,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 65 states and 81 transitions. [2018-11-10 01:21:20,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 01:21:20,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 01:21:20,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2018-11-10 01:21:20,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:20,269 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-11-10 01:21:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2018-11-10 01:21:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-11-10 01:21:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 01:21:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-11-10 01:21:20,272 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-10 01:21:20,272 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-10 01:21:20,272 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 01:21:20,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2018-11-10 01:21:20,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:21:20,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:20,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:20,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-10 01:21:20,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:21:20,274 INFO L793 eck$LassoCheckResult]: Stem: 1732#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1728#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 1729#L18-3 assume true; 1745#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1743#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 1733#L20-3 assume true; 1734#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 1759#L20-3 assume true; 1752#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 1753#L20-4 main_~x~0 := main_~x~0 - 1; 1740#L19-2 main_~y~0 := main_~y~0 - 1; 1726#L18-3 assume true; 1727#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1738#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 1735#L20-3 assume true; 1736#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 1757#L20-3 assume true; 1758#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 1750#L20-4 main_~x~0 := main_~x~0 - 1; 1751#L19-2 main_~y~0 := main_~y~0 - 1; 1775#L18-3 assume true; 1774#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1744#L19 assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 1739#L19-2 [2018-11-10 01:21:20,274 INFO L795 eck$LassoCheckResult]: Loop: 1739#L19-2 main_~y~0 := main_~y~0 - 1; 1724#L18-3 assume true; 1725#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1737#L19 assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 1739#L19-2 [2018-11-10 01:21:20,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1888759210, now seen corresponding path program 1 times [2018-11-10 01:21:20,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:20,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:20,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:20,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:20,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1912793, now seen corresponding path program 2 times [2018-11-10 01:21:20,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:20,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:20,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:20,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1979568046, now seen corresponding path program 2 times [2018-11-10 01:21:20,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:20,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 01:21:20,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:21:20,314 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:21:20,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:21:20,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:21:20,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:21:20,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 01:21:20,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:21:20,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 01:21:20,368 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:20,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:20,369 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:20,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:20,369 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:20,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:20,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:20,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:20,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-10 01:21:20,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:20,369 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:20,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,410 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:20,410 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:20,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:20,412 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:20,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:20,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:20,480 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:20,481 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:20,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:20,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:20,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:20,482 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:20,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:20,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:20,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:20,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-10 01:21:20,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:20,482 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:20,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,520 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:20,520 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:20,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:20,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:20,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:20,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:20,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:20,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:20,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:21:20,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:20,525 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:20,526 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:20,526 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 01:21:20,526 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:20,526 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:20,526 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:20,526 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 01:21:20,527 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:20,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:20,552 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 [2018-11-10 01:21:20,552 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 71 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-10 01:21:20,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 71 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 173 states and 226 transitions. Complement of second has 7 states. [2018-11-10 01:21:20,564 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 [2018-11-10 01:21:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:21:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 01:21:20,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-10 01:21:20,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 27 letters. Loop has 4 letters. [2018-11-10 01:21:20,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-10 01:21:20,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 226 transitions. [2018-11-10 01:21:20,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:21:20,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 132 states and 167 transitions. [2018-11-10 01:21:20,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 01:21:20,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 01:21:20,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 167 transitions. [2018-11-10 01:21:20,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:20,568 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 167 transitions. [2018-11-10 01:21:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 167 transitions. [2018-11-10 01:21:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-11-10 01:21:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 01:21:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2018-11-10 01:21:20,572 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 127 transitions. [2018-11-10 01:21:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:21:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:21:20,573 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand 5 states. [2018-11-10 01:21:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:21:20,585 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2018-11-10 01:21:20,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:21:20,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 181 transitions. [2018-11-10 01:21:20,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:21:20,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 115 states and 144 transitions. [2018-11-10 01:21:20,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 01:21:20,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 01:21:20,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 144 transitions. [2018-11-10 01:21:20,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:20,587 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 144 transitions. [2018-11-10 01:21:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 144 transitions. [2018-11-10 01:21:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-11-10 01:21:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 01:21:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2018-11-10 01:21:20,591 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 140 transitions. [2018-11-10 01:21:20,591 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 140 transitions. [2018-11-10 01:21:20,591 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 01:21:20,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 140 transitions. [2018-11-10 01:21:20,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:21:20,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:20,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:20,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1] [2018-11-10 01:21:20,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:21:20,592 INFO L793 eck$LassoCheckResult]: Stem: 2397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 2394#L18-3 assume true; 2413#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 2408#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 2398#L20-3 assume true; 2399#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 2400#L20-3 assume true; 2401#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 2407#L20-3 assume true; 2494#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 2499#L20-4 main_~x~0 := main_~x~0 - 1; 2456#L19-2 main_~y~0 := main_~y~0 - 1; 2454#L18-3 assume true; 2452#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 2447#L19 assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 2412#L19-2 main_~y~0 := main_~y~0 - 1; 2443#L18-3 assume true; 2441#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 2437#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 2411#L20-3 assume true; 2426#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 2427#L20-3 assume true; 2422#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 2420#L20-4 main_~x~0 := main_~x~0 - 1; 2421#L19-2 main_~y~0 := main_~y~0 - 1; 2416#L18-3 assume true; 2417#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 2410#L19 assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 2403#L19-2 [2018-11-10 01:21:20,592 INFO L795 eck$LassoCheckResult]: Loop: 2403#L19-2 main_~y~0 := main_~y~0 - 1; 2389#L18-3 assume true; 2390#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 2405#L19 assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 2403#L19-2 [2018-11-10 01:21:20,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,593 INFO L82 PathProgramCache]: Analyzing trace with hash -595826716, now seen corresponding path program 3 times [2018-11-10 01:21:20,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:20,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:20,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1912793, now seen corresponding path program 3 times [2018-11-10 01:21:20,604 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:20,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:20,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash -158536132, now seen corresponding path program 4 times [2018-11-10 01:21:20,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:20,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 01:21:20,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:21:20,671 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:21:20,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 01:21:20,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 01:21:20,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:21:20,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 01:21:20,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:21:20,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 01:21:20,721 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:20,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:20,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:20,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:20,722 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:20,722 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:20,722 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:20,722 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:20,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration9_Loop [2018-11-10 01:21:20,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:20,722 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:20,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,750 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:20,750 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:20,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:20,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:20,768 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:20,768 INFO L446 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_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:20,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:20,770 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:20,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:20,791 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:20,843 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:20,844 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:20,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:20,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:20,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:20,844 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:20,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:20,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:20,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:20,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration9_Loop [2018-11-10 01:21:20,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:20,845 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:20,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:20,876 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:20,876 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:20,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:20,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:20,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:20,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:20,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:20,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:21:20,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:21:20,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:20,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:20,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:20,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:20,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:20,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:20,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:20,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:21:20,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:20,881 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:20,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:20,882 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 01:21:20,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:20,882 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:20,882 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:20,882 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 01:21:20,883 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:20,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:20,925 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 [2018-11-10 01:21:20,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 140 transitions. cyclomatic complexity: 41 Second operand 4 states. [2018-11-10 01:21:20,937 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 140 transitions. cyclomatic complexity: 41. Second operand 4 states. Result 143 states and 179 transitions. Complement of second has 7 states. [2018-11-10 01:21:20,938 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 [2018-11-10 01:21:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:21:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 01:21:20,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 01:21:20,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:20,939 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:21:20,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:20,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:20,979 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 [2018-11-10 01:21:20,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 140 transitions. cyclomatic complexity: 41 Second operand 4 states. [2018-11-10 01:21:21,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 140 transitions. cyclomatic complexity: 41. Second operand 4 states. Result 200 states and 247 transitions. Complement of second has 9 states. [2018-11-10 01:21:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 01:21:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:21:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-10 01:21:21,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 01:21:21,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:21,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-10 01:21:21,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:21,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-10 01:21:21,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:21,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 247 transitions. [2018-11-10 01:21:21,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:21:21,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 191 states and 234 transitions. [2018-11-10 01:21:21,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 01:21:21,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 01:21:21,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 234 transitions. [2018-11-10 01:21:21,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:21,005 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 234 transitions. [2018-11-10 01:21:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 234 transitions. [2018-11-10 01:21:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 166. [2018-11-10 01:21:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 01:21:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2018-11-10 01:21:21,011 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 207 transitions. [2018-11-10 01:21:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:21:21,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:21:21,011 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand 6 states. [2018-11-10 01:21:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:21:21,050 INFO L93 Difference]: Finished difference Result 424 states and 506 transitions. [2018-11-10 01:21:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:21:21,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 424 states and 506 transitions. [2018-11-10 01:21:21,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:21:21,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 424 states to 272 states and 328 transitions. [2018-11-10 01:21:21,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 01:21:21,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 01:21:21,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 328 transitions. [2018-11-10 01:21:21,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:21:21,055 INFO L705 BuchiCegarLoop]: Abstraction has 272 states and 328 transitions. [2018-11-10 01:21:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 328 transitions. [2018-11-10 01:21:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 219. [2018-11-10 01:21:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-10 01:21:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 271 transitions. [2018-11-10 01:21:21,061 INFO L728 BuchiCegarLoop]: Abstraction has 219 states and 271 transitions. [2018-11-10 01:21:21,062 INFO L608 BuchiCegarLoop]: Abstraction has 219 states and 271 transitions. [2018-11-10 01:21:21,062 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 01:21:21,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 219 states and 271 transitions. [2018-11-10 01:21:21,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:21:21,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:21:21,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:21:21,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1] [2018-11-10 01:21:21,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:21:21,063 INFO L793 eck$LassoCheckResult]: Stem: 3777#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3773#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 3774#L18-3 assume true; 3783#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 3784#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 3779#L20-3 assume true; 3780#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 3860#L20-3 assume true; 3848#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 3849#L20-3 assume true; 3875#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 3951#L20-3 assume true; 3948#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 3986#L20-4 main_~x~0 := main_~x~0 - 1; 3945#L19-2 main_~y~0 := main_~y~0 - 1; 3944#L18-3 assume true; 3888#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 3889#L19 assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 3885#L19-2 main_~y~0 := main_~y~0 - 1; 3910#L18-3 assume true; 3815#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 3813#L19 assume main_#t~nondet1 != 0;havoc main_#t~nondet1; 3809#L20-3 assume true; 3810#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 3805#L20-3 assume true; 3801#L20-1 assume !!(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2;main_~y~0 := main_~y~0 + 1; 3794#L20-3 assume true; 3800#L20-1 assume !(main_~y~0 <= main_~m~0 && main_#t~nondet2 != 0);havoc main_#t~nondet2; 3799#L20-4 main_~x~0 := main_~x~0 - 1; 3798#L19-2 main_~y~0 := main_~y~0 - 1; 3797#L18-3 assume true; 3796#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 3793#L19 assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 3778#L19-2 [2018-11-10 01:21:21,064 INFO L795 eck$LassoCheckResult]: Loop: 3778#L19-2 main_~y~0 := main_~y~0 - 1; 3769#L18-3 assume true; 3770#L18-1 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 3787#L19 assume !(main_#t~nondet1 != 0);havoc main_#t~nondet1; 3778#L19-2 [2018-11-10 01:21:21,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash -298374300, now seen corresponding path program 5 times [2018-11-10 01:21:21,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:21,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:21,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:21,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:21,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:21,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1912793, now seen corresponding path program 4 times [2018-11-10 01:21:21,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:21,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:21,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:21,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:21,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1580855740, now seen corresponding path program 6 times [2018-11-10 01:21:21,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:21:21,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:21:21,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:21,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:21:21,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:21:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:21,094 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:21,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:21,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:21,094 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:21,094 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:21:21,094 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:21,094 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:21,094 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:21,094 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-10 01:21:21,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:21,095 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:21,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,138 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:21,138 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:21,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:21,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:21,146 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:21,146 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:21,170 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:21,170 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:21,186 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:21:21,186 INFO L446 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_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:21,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:21:21,189 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e233f86b-2ad2-49ee-90eb-d15882a73c79/bin-2019/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 [2018-11-10 01:21:21,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:21:21,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:21:21,257 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:21:21,258 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:21:21,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:21:21,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:21:21,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:21:21,259 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:21:21,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:21:21,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:21:21,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:21:21,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-10 01:21:21,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:21:21,259 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:21:21,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:21:21,289 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:21:21,289 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:21:21,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:21,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:21,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:21,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:21,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:21,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:21,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:21:21,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:21,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:21,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:21,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:21,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:21,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:21,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:21,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:21:21,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:21:21,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:21:21,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:21:21,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:21:21,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:21:21,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:21:21,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:21:21,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:21:21,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:21:21,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:21:21,297 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:21:21,298 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:21:21,298 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 01:21:21,298 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:21:21,298 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:21:21,298 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:21:21,299 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 01:21:21,299 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:21:21,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:21,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:21,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:21,345 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 [2018-11-10 01:21:21,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 219 states and 271 transitions. cyclomatic complexity: 73 Second operand 4 states. [2018-11-10 01:21:21,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 219 states and 271 transitions. cyclomatic complexity: 73. Second operand 4 states. Result 294 states and 363 transitions. Complement of second has 7 states. [2018-11-10 01:21:21,365 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 [2018-11-10 01:21:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:21:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 01:21:21,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-10 01:21:21,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:21,366 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:21:21,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:21,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:21,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:21,408 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 [2018-11-10 01:21:21,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 219 states and 271 transitions. cyclomatic complexity: 73 Second operand 4 states. [2018-11-10 01:21:21,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 219 states and 271 transitions. cyclomatic complexity: 73. Second operand 4 states. Result 352 states and 429 transitions. Complement of second has 9 states. [2018-11-10 01:21:21,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 01:21:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:21:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-10 01:21:21,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-10 01:21:21,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:21,431 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:21:21,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:21,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:21,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:21:21,462 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 [2018-11-10 01:21:21,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 219 states and 271 transitions. cyclomatic complexity: 73 Second operand 4 states. [2018-11-10 01:21:21,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 219 states and 271 transitions. cyclomatic complexity: 73. Second operand 4 states. Result 375 states and 475 transitions. Complement of second has 8 states. [2018-11-10 01:21:21,475 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 [2018-11-10 01:21:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:21:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-10 01:21:21,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-10 01:21:21,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:21,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 37 letters. Loop has 4 letters. [2018-11-10 01:21:21,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:21,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 33 letters. Loop has 8 letters. [2018-11-10 01:21:21,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:21:21,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 475 transitions. [2018-11-10 01:21:21,477 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 01:21:21,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 0 states and 0 transitions. [2018-11-10 01:21:21,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 01:21:21,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 01:21:21,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 01:21:21,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:21:21,478 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:21:21,478 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:21:21,478 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:21:21,478 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 01:21:21,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 01:21:21,478 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 01:21:21,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 01:21:21,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:21:21 BoogieIcfgContainer [2018-11-10 01:21:21,483 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 01:21:21,483 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:21:21,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:21:21,484 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:21:21,484 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:21:17" (3/4) ... [2018-11-10 01:21:21,486 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 01:21:21,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:21:21,487 INFO L168 Benchmark]: Toolchain (without parser) took 4481.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 954.8 MB in the beginning and 831.9 MB in the end (delta: 123.0 MB). Peak memory consumption was 353.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:21,488 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:21:21,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.98 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:21,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:21:21,489 INFO L168 Benchmark]: Boogie Preprocessor took 14.74 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:21,489 INFO L168 Benchmark]: RCFGBuilder took 187.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -205.6 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:21,490 INFO L168 Benchmark]: BuchiAutomizer took 4130.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 836.7 MB in the end (delta: 310.3 MB). Peak memory consumption was 383.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:21,490 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 831.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:21:21,493 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 123.98 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.74 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 187.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -205.6 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4130.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 836.7 MB in the end (delta: 310.3 MB). Peak memory consumption was 383.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 831.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (4 trivial, 7 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * y + 2 * m + 1 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 5 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 5 locations. One nondeterministic module has affine ranking function -2 * y + 2 * m + 1 and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 11 iterations. TraceHistogramMax:7. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 173 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 219 states and ocurred in iteration 9. Nontrivial modules had stage [5, 2, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 241 SDtfs, 244 SDslu, 148 SDs, 0 SdLazy, 181 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT6 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax166 hnf99 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf94 smp100 dnf111 smp100 tf111 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 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...