./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-91b1670 [2018-11-28 23:14:45,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:14:45,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:14:45,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:14:45,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:14:45,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:14:45,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:14:45,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:14:45,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:14:45,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:14:45,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:14:45,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:14:45,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:14:45,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:14:45,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:14:45,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:14:45,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:14:45,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:14:45,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:14:45,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:14:45,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:14:45,554 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:14:45,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:14:45,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:14:45,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:14:45,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:14:45,560 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:14:45,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:14:45,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:14:45,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:14:45,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:14:45,565 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:14:45,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:14:45,566 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:14:45,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:14:45,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:14:45,568 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:14:45,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:14:45,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:14:45,603 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:14:45,603 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:14:45,603 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:14:45,604 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:14:45,604 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:14:45,604 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:14:45,604 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:14:45,604 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:14:45,605 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:14:45,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:14:45,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:14:45,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:14:45,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:14:45,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:14:45,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:14:45,607 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:14:45,607 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:14:45,607 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:14:45,609 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:14:45,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:14:45,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:14:45,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:14:45,610 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:14:45,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:14:45,610 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:14:45,611 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:14:45,613 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:14:45,613 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-28 23:14:45,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:14:45,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:14:45,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:14:45,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:14:45,693 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:14:45,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2018-11-28 23:14:45,755 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37b1580b8/a5c8ffcac6bb4a3392b48be7a4214b4d/FLAGe95ab7c5c [2018-11-28 23:14:46,199 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:14:46,199 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2018-11-28 23:14:46,205 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37b1580b8/a5c8ffcac6bb4a3392b48be7a4214b4d/FLAGe95ab7c5c [2018-11-28 23:14:46,588 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37b1580b8/a5c8ffcac6bb4a3392b48be7a4214b4d [2018-11-28 23:14:46,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:14:46,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:14:46,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:46,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:14:46,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:14:46,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308ccefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46, skipping insertion in model container [2018-11-28 23:14:46,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:14:46,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:14:46,879 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:46,885 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:14:46,909 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:46,928 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:14:46,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46 WrapperNode [2018-11-28 23:14:46,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:46,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:46,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:14:46,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:14:46,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:46,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:14:46,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:14:46,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:14:46,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... [2018-11-28 23:14:46,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:14:46,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:14:46,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:14:46,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:14:46,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:47,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:14:47,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:14:47,500 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:14:47,500 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 23:14:47,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:47 BoogieIcfgContainer [2018-11-28 23:14:47,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:14:47,503 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:14:47,503 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:14:47,509 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:14:47,510 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:47,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:14:46" (1/3) ... [2018-11-28 23:14:47,512 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@752dacb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:47, skipping insertion in model container [2018-11-28 23:14:47,513 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:47,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:46" (2/3) ... [2018-11-28 23:14:47,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@752dacb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:47, skipping insertion in model container [2018-11-28 23:14:47,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:47,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:47" (3/3) ... [2018-11-28 23:14:47,517 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2018-11-28 23:14:47,637 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:14:47,639 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:14:47,639 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:14:47,639 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:14:47,642 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:14:47,642 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:14:47,643 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:14:47,643 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:14:47,643 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:14:47,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 23:14:47,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:47,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:47,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:47,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:14:47,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:47,750 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:14:47,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 23:14:47,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:47,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:47,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:47,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:14:47,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:47,763 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue 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; 5#L18-2true [2018-11-28 23:14:47,763 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-2true assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 11#L19true assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 7#L19-2true main_~y~0 := main_~y~0 - 1; 5#L18-2true [2018-11-28 23:14:47,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:47,772 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 23:14:47,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:47,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:47,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash 40299, now seen corresponding path program 1 times [2018-11-28 23:14:47,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:47,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:47,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:47,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:47,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash 963820, now seen corresponding path program 1 times [2018-11-28 23:14:47,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:47,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:47,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:47,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:47,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:48,029 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:48,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:48,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:48,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:48,031 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:48,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:48,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:48,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:48,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:14:48,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:48,032 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:48,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,288 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:48,289 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:48,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:48,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:48,331 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:48,331 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:48,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:48,337 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:48,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:48,359 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:48,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:48,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:48,420 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:48,420 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:14:48,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:48,429 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:48,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:48,442 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:14:48,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:48,483 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:14:48,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:48,538 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:48,580 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:48,583 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:48,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:48,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:48,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:48,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:48,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:48,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:48,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:48,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:14:48,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:48,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:48,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-28 23:14:48,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:48,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:48,916 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:48,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:48,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:48,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:48,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:48,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:48,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:48,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:48,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:48,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:48,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:48,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:48,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:48,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:48,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:48,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:48,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:48,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:48,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:48,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:48,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:48,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:48,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:48,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:48,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:48,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:48,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:48,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:48,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:48,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:48,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:48,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:48,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:48,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:48,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:48,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:48,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:48,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:48,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:48,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:48,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:48,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:48,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:48,984 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:48,989 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:48,989 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:14:48,991 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:48,991 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:48,992 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:48,992 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2018-11-28 23:14:48,994 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:49,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:49,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:49,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:49,276 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-28 23:14:49,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 3 states. [2018-11-28 23:14:49,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 3 states. Result 37 states and 54 transitions. Complement of second has 8 states. [2018-11-28 23:14:49,362 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-28 23:14:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-28 23:14:49,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 1 letters. Loop has 3 letters. [2018-11-28 23:14:49,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:49,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:14:49,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:49,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 1 letters. Loop has 6 letters. [2018-11-28 23:14:49,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:49,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2018-11-28 23:14:49,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:49,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 14 states and 20 transitions. [2018-11-28 23:14:49,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:14:49,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:14:49,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2018-11-28 23:14:49,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:49,382 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-28 23:14:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2018-11-28 23:14:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 23:14:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:14:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-28 23:14:49,412 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-28 23:14:49,412 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-28 23:14:49,412 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:14:49,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-28 23:14:49,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:49,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:49,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:49,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:14:49,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:49,415 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY 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; 93#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 91#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 98#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 99#L20-2 [2018-11-28 23:14:49,415 INFO L796 eck$LassoCheckResult]: Loop: 99#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 99#L20-2 [2018-11-28 23:14:49,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash 963347, now seen corresponding path program 1 times [2018-11-28 23:14:49,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:49,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:49,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:49,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2018-11-28 23:14:49,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:49,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:49,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:49,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash 29863779, now seen corresponding path program 2 times [2018-11-28 23:14:49,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:49,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:49,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:49,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:49,531 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:49,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:49,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:49,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:49,532 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:49,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:49,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:49,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:49,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:14:49,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:49,532 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:49,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:49,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:49,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:49,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:49,652 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:49,652 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:49,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:49,658 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:49,681 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:49,681 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:49,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:49,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:49,708 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:49,708 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:49,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:49,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:49,725 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:49,725 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:49,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:49,754 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:14:49,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:49,810 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:50,039 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:50,042 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:50,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:50,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:50,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:50,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:50,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:50,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:50,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:50,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:14:50,045 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:50,045 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:50,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,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-28 23:14:50,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,344 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:50,344 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:50,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:50,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:50,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:50,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:50,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:50,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:50,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:50,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:50,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:50,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:50,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:50,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:50,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:50,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:50,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:50,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:50,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:50,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:50,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:50,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:50,362 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:14:50,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:50,363 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:14:50,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:50,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:50,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:50,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:50,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:50,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:50,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:50,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:50,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:50,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:50,373 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:50,378 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:50,378 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:14:50,378 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:50,379 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:50,379 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:50,379 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2018-11-28 23:14:50,379 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:50,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:50,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:50,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:50,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:50,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 2 states. [2018-11-28 23:14:50,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 2 states. Result 25 states and 39 transitions. Complement of second has 6 states. [2018-11-28 23:14:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:14:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-28 23:14:50,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 1 letters. [2018-11-28 23:14:50,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:50,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-28 23:14:50,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:50,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:14:50,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:50,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2018-11-28 23:14:50,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:50,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2018-11-28 23:14:50,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:14:50,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:14:50,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2018-11-28 23:14:50,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:50,503 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-11-28 23:14:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2018-11-28 23:14:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-28 23:14:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:14:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-11-28 23:14:50,506 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 23:14:50,506 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 23:14:50,506 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:14:50,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2018-11-28 23:14:50,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:50,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:50,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:50,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:14:50,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:14:50,510 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY 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; 163#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 168#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 177#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 176#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 169#L20-3 [2018-11-28 23:14:50,510 INFO L796 eck$LassoCheckResult]: Loop: 169#L20-3 main_~x~0 := main_~x~0 - 1; 170#L19-2 main_~y~0 := main_~y~0 - 1; 164#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 165#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 173#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 169#L20-3 [2018-11-28 23:14:50,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash 29863777, now seen corresponding path program 1 times [2018-11-28 23:14:50,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:50,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:50,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:50,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:50,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:50,524 INFO L82 PathProgramCache]: Analyzing trace with hash 53544460, now seen corresponding path program 1 times [2018-11-28 23:14:50,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:50,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:50,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:50,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:50,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:50,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1236267692, now seen corresponding path program 1 times [2018-11-28 23:14:50,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:50,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:50,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:50,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:50,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:50,832 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 23:14:50,833 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:50,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:50,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:50,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:50,834 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:50,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:50,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:50,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:50,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:14:50,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:50,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:50,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:50,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:51,057 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:51,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:51,062 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:51,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:51,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:51,215 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:51,217 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:51,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:51,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:51,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:51,218 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:51,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:51,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:51,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:51,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:14:51,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:51,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:51,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,485 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:51,485 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:51,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:51,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:51,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:51,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:51,489 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:14:51,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:51,491 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:14:51,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:51,499 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:51,504 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:51,504 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:51,505 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:51,505 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:51,505 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:51,505 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-28 23:14:51,507 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:51,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:51,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:51,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:51,586 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-28 23:14:51,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 24 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-28 23:14:51,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 24 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 46 states and 68 transitions. Complement of second has 8 states. [2018-11-28 23:14:51,626 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-28 23:14:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:14:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 23:14:51,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-28 23:14:51,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:51,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-28 23:14:51,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:51,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:14:51,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:51,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2018-11-28 23:14:51,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:51,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 32 states and 46 transitions. [2018-11-28 23:14:51,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:14:51,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:14:51,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 46 transitions. [2018-11-28 23:14:51,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:51,633 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-11-28 23:14:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 46 transitions. [2018-11-28 23:14:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 23:14:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:14:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2018-11-28 23:14:51,637 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-11-28 23:14:51,637 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-11-28 23:14:51,637 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:14:51,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 44 transitions. [2018-11-28 23:14:51,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:51,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:51,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:51,639 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:14:51,639 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:14:51,640 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY 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; 280#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 281#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 295#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 288#L20-3 main_~x~0 := main_~x~0 - 1; 289#L19-2 main_~y~0 := main_~y~0 - 1; 292#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 305#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 304#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 302#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 298#L20-3 [2018-11-28 23:14:51,640 INFO L796 eck$LassoCheckResult]: Loop: 298#L20-3 main_~x~0 := main_~x~0 - 1; 290#L19-2 main_~y~0 := main_~y~0 - 1; 291#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 299#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 294#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 298#L20-3 [2018-11-28 23:14:51,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash -363863338, now seen corresponding path program 2 times [2018-11-28 23:14:51,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:51,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:51,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:51,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:51,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:14:51,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:14:51,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:14:51,697 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:14:51,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:51,697 INFO L82 PathProgramCache]: Analyzing trace with hash 53544460, now seen corresponding path program 2 times [2018-11-28 23:14:51,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:51,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:51,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:51,797 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:51,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:51,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:51,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:51,797 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:51,797 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:51,797 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:51,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:51,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:14:51,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:51,798 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:51,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:51,984 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:51,984 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:51,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:51,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:51,995 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:51,995 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:52,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:52,017 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:52,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:52,042 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:52,084 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:52,085 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:52,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:52,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:52,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:52,086 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:52,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:52,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:52,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:14:52,087 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:52,087 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:52,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,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-28 23:14:52,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,263 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:52,264 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:52,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:52,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:52,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:52,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:52,265 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:14:52,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:52,266 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:14:52,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:52,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:52,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:52,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:52,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:52,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:52,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:52,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:52,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:52,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:52,276 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:52,278 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:52,279 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:52,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:52,279 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:52,280 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:52,280 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:14:52,280 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:52,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:52,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:52,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:52,391 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-28 23:14:52,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-28 23:14:52,434 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 80 states and 118 transitions. Complement of second has 7 states. [2018-11-28 23:14:52,437 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-28 23:14:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-28 23:14:52,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-28 23:14:52,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:52,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-28 23:14:52,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:52,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 10 letters. Loop has 10 letters. [2018-11-28 23:14:52,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:52,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 118 transitions. [2018-11-28 23:14:52,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:14:52,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 54 states and 78 transitions. [2018-11-28 23:14:52,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:14:52,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:14:52,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 78 transitions. [2018-11-28 23:14:52,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:52,445 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. [2018-11-28 23:14:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 78 transitions. [2018-11-28 23:14:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2018-11-28 23:14:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:14:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2018-11-28 23:14:52,450 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2018-11-28 23:14:52,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:14:52,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:14:52,456 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 4 states. [2018-11-28 23:14:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:52,489 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2018-11-28 23:14:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:14:52,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-11-28 23:14:52,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:14:52,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 31 states and 46 transitions. [2018-11-28 23:14:52,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:14:52,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:14:52,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2018-11-28 23:14:52,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:52,494 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-11-28 23:14:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2018-11-28 23:14:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-28 23:14:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 23:14:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2018-11-28 23:14:52,519 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-11-28 23:14:52,519 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-11-28 23:14:52,521 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:14:52,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 46 transitions. [2018-11-28 23:14:52,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:14:52,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:52,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:52,522 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:14:52,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:52,522 INFO L794 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY 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; 538#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 539#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 551#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 559#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 546#L20-3 main_~x~0 := main_~x~0 - 1; 547#L19-2 main_~y~0 := main_~y~0 - 1; 567#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 565#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 549#L20-2 [2018-11-28 23:14:52,523 INFO L796 eck$LassoCheckResult]: Loop: 549#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 549#L20-2 [2018-11-28 23:14:52,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1840994920, now seen corresponding path program 3 times [2018-11-28 23:14:52,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:52,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2018-11-28 23:14:52,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:52,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:52,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:52,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1236267694, now seen corresponding path program 4 times [2018-11-28 23:14:52,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:52,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:52,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:52,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,624 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:52,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:52,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:52,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:52,624 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:52,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:52,625 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:52,625 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:14:52,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:52,625 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:52,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-28 23:14:52,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,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-28 23:14:52,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,703 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:52,703 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:52,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:52,707 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:52,737 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:52,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:52,865 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:52,867 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:52,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:52,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:52,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:52,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:52,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:52,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:52,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:14:52,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:52,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:52,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,941 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:52,941 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:52,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:52,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:52,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:52,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:52,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:52,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:52,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:52,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:52,947 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:52,949 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:52,950 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:14:52,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:52,950 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:52,950 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:52,950 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2018-11-28 23:14:52,951 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:52,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:53,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:53,008 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2018-11-28 23:14:53,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 34 states and 50 transitions. Complement of second has 5 states. [2018-11-28 23:14:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:14:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:14:53,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 9 letters. Loop has 1 letters. [2018-11-28 23:14:53,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,034 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:53,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:53,071 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:53,071 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2018-11-28 23:14:53,084 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 34 states and 50 transitions. Complement of second has 5 states. [2018-11-28 23:14:53,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:14:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:14:53,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 9 letters. Loop has 1 letters. [2018-11-28 23:14:53,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,086 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:53,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:53,117 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:53,117 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2018-11-28 23:14:53,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 38 states and 54 transitions. Complement of second has 4 states. [2018-11-28 23:14:53,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:14:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-28 23:14:53,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 1 letters. [2018-11-28 23:14:53,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 1 letters. [2018-11-28 23:14:53,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:14:53,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2018-11-28 23:14:53,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:53,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 37 transitions. [2018-11-28 23:14:53,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:14:53,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:14:53,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2018-11-28 23:14:53,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:53,140 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-11-28 23:14:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2018-11-28 23:14:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-11-28 23:14:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:14:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2018-11-28 23:14:53,145 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-28 23:14:53,145 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-28 23:14:53,145 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:14:53,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2018-11-28 23:14:53,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:53,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:53,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:53,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1] [2018-11-28 23:14:53,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:53,149 INFO L794 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY 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; 799#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 806#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 803#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 804#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 802#L20-3 main_~x~0 := main_~x~0 - 1; 801#L19-2 main_~y~0 := main_~y~0 - 1; 796#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 797#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 807#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 810#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 813#L20-3 main_~x~0 := main_~x~0 - 1; 812#L19-2 main_~y~0 := main_~y~0 - 1; 811#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 808#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 800#L19-2 [2018-11-28 23:14:53,149 INFO L796 eck$LassoCheckResult]: Loop: 800#L19-2 main_~y~0 := main_~y~0 - 1; 794#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 795#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 800#L19-2 [2018-11-28 23:14:53,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1970756676, now seen corresponding path program 1 times [2018-11-28 23:14:53,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,183 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 2 times [2018-11-28 23:14:53,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1390830772, now seen corresponding path program 2 times [2018-11-28 23:14:53,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:53,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 23:14:53,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:14:53,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:14:53,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:14:53,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:14:53,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:14:53,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 23:14:53,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:14:53,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 23:14:53,393 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:53,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:53,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:53,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:53,394 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:53,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:53,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:53,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:14:53,395 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:53,395 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:53,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:53,537 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:53,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,544 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,564 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:53,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,570 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,592 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,597 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,600 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,600 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:53,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,620 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:53,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:53,645 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,686 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:53,688 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:53,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:53,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:53,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:53,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:53,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:53,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:53,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:14:53,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:53,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:53,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,763 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:53,763 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:53,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:53,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:53,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:53,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:53,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:53,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:53,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:53,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:53,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:53,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:53,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:53,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:53,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:53,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:53,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:53,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:53,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:53,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:53,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:53,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:53,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:53,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:53,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:53,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:53,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:53,775 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:53,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:53,777 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:53,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:53,778 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:53,778 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:53,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-28 23:14:53,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:53,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:53,868 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-28 23:14:53,868 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:14:53,890 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 63 states and 85 transitions. Complement of second has 7 states. [2018-11-28 23:14:53,892 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-28 23:14:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:14:53,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 23:14:53,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 23:14:53,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 23:14:53,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 85 transitions. [2018-11-28 23:14:53,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:53,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 44 states and 59 transitions. [2018-11-28 23:14:53,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:14:53,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:14:53,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2018-11-28 23:14:53,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:53,897 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2018-11-28 23:14:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2018-11-28 23:14:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-11-28 23:14:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:14:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-11-28 23:14:53,901 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-28 23:14:53,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:14:53,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:14:53,902 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 5 states. [2018-11-28 23:14:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:53,952 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-11-28 23:14:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:14:53,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 68 transitions. [2018-11-28 23:14:53,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:53,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 45 states and 58 transitions. [2018-11-28 23:14:53,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:14:53,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:14:53,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2018-11-28 23:14:53,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:53,959 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2018-11-28 23:14:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2018-11-28 23:14:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-11-28 23:14:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:14:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-11-28 23:14:53,966 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-28 23:14:53,966 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-28 23:14:53,966 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:14:53,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2018-11-28 23:14:53,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:53,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:53,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:53,968 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1] [2018-11-28 23:14:53,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:53,968 INFO L794 eck$LassoCheckResult]: Stem: 1103#ULTIMATE.startENTRY 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; 1104#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1112#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1108#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1109#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1133#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1107#L20-3 main_~x~0 := main_~x~0 - 1; 1106#L19-2 main_~y~0 := main_~y~0 - 1; 1101#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1102#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1124#L19-2 main_~y~0 := main_~y~0 - 1; 1127#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1123#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1121#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1117#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1120#L20-3 main_~x~0 := main_~x~0 - 1; 1119#L19-2 main_~y~0 := main_~y~0 - 1; 1118#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1115#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1105#L19-2 [2018-11-28 23:14:53,968 INFO L796 eck$LassoCheckResult]: Loop: 1105#L19-2 main_~y~0 := main_~y~0 - 1; 1099#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1100#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1105#L19-2 [2018-11-28 23:14:53,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash 715204654, now seen corresponding path program 3 times [2018-11-28 23:14:53,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:53,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 3 times [2018-11-28 23:14:54,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:54,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:54,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash -670878974, now seen corresponding path program 4 times [2018-11-28 23:14:54,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:54,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 23:14:54,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:14:54,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:54,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:14:54,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:14:54,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:14:54,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 23:14:54,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:14:54,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 23:14:54,290 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:54,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:54,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:54,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:54,291 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:54,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:54,292 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:54,292 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:54,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 23:14:54,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:54,293 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:54,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,397 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:54,398 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:54,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:54,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:54,426 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:54,426 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:54,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:54,432 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:54,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:54,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:54,497 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:54,498 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:54,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:54,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:54,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:54,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:54,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:54,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:54,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:54,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 23:14:54,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:54,499 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:54,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,590 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:54,590 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:54,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:54,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:54,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:54,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:54,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:54,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:54,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:54,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:54,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:54,596 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:54,597 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:54,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:54,597 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:54,597 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:54,597 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-28 23:14:54,598 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:54,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:54,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:54,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:54,696 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-28 23:14:54,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-28 23:14:54,717 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 46 states and 61 transitions. Complement of second has 7 states. [2018-11-28 23:14:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:14:54,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-28 23:14:54,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:54,721 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:54,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:54,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:54,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:54,781 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-28 23:14:54,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-28 23:14:54,857 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 74 states and 97 transitions. Complement of second has 9 states. [2018-11-28 23:14:54,859 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-28 23:14:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-28 23:14:54,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-28 23:14:54,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:54,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:14:54,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:54,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-28 23:14:54,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:54,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 97 transitions. [2018-11-28 23:14:54,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:54,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 89 transitions. [2018-11-28 23:14:54,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:14:54,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:14:54,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 89 transitions. [2018-11-28 23:14:54,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:54,866 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 89 transitions. [2018-11-28 23:14:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 89 transitions. [2018-11-28 23:14:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-11-28 23:14:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 23:14:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2018-11-28 23:14:54,872 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 80 transitions. [2018-11-28 23:14:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:14:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:14:54,873 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2018-11-28 23:14:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:54,927 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2018-11-28 23:14:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:14:54,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2018-11-28 23:14:54,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:54,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 107 states and 137 transitions. [2018-11-28 23:14:54,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:14:54,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:14:54,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 137 transitions. [2018-11-28 23:14:54,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:54,933 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 137 transitions. [2018-11-28 23:14:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 137 transitions. [2018-11-28 23:14:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2018-11-28 23:14:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 23:14:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2018-11-28 23:14:54,940 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2018-11-28 23:14:54,941 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2018-11-28 23:14:54,941 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:14:54,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 111 transitions. [2018-11-28 23:14:54,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:54,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:54,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:54,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1] [2018-11-28 23:14:54,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:54,943 INFO L794 eck$LassoCheckResult]: Stem: 1705#ULTIMATE.startENTRY 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; 1706#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1719#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1715#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1716#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1754#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1753#L20-3 main_~x~0 := main_~x~0 - 1; 1752#L19-2 main_~y~0 := main_~y~0 - 1; 1750#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1751#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1742#L19-2 main_~y~0 := main_~y~0 - 1; 1741#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1738#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1735#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1732#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1734#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1724#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1727#L20-3 main_~x~0 := main_~x~0 - 1; 1726#L19-2 main_~y~0 := main_~y~0 - 1; 1725#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1722#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1713#L19-2 [2018-11-28 23:14:54,943 INFO L796 eck$LassoCheckResult]: Loop: 1713#L19-2 main_~y~0 := main_~y~0 - 1; 1707#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1708#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1713#L19-2 [2018-11-28 23:14:54,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1768639598, now seen corresponding path program 5 times [2018-11-28 23:14:54,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:54,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:54,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:54,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 4 times [2018-11-28 23:14:54,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:54,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1116494142, now seen corresponding path program 6 times [2018-11-28 23:14:54,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:54,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:54,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:55,067 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:55,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:55,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:55,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:55,068 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:55,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,069 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:55,069 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:55,069 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:14:55,069 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:55,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:55,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,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-28 23:14:55,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,138 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:55,138 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:55,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:55,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:55,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:55,167 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:55,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:55,171 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:14:55,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:55,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:55,237 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:55,239 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:55,239 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:55,239 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:55,240 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:55,240 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:55,240 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,240 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:55,240 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:55,240 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:14:55,240 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:55,240 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:55,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,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-28 23:14:55,307 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:55,307 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:55,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:55,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:55,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:55,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:55,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:55,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:55,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:55,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:55,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:55,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:55,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:55,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:55,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:55,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:55,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:55,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:55,316 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:55,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:55,318 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:55,318 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:55,318 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:55,318 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:55,318 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-28 23:14:55,319 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:55,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:55,719 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-28 23:14:55,720 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2018-11-28 23:14:55,743 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 101 states and 134 transitions. Complement of second has 7 states. [2018-11-28 23:14:55,745 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-28 23:14:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:14:55,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-28 23:14:55,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:55,747 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:55,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:55,894 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-28 23:14:55,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2018-11-28 23:14:55,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 128 states and 166 transitions. Complement of second has 9 states. [2018-11-28 23:14:55,935 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-28 23:14:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-28 23:14:55,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-28 23:14:55,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:55,936 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:55,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:55,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:56,072 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-28 23:14:56,072 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2018-11-28 23:14:56,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 139 states and 187 transitions. Complement of second has 8 states. [2018-11-28 23:14:56,133 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-28 23:14:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:14:56,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-28 23:14:56,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-28 23:14:56,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-28 23:14:56,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 187 transitions. [2018-11-28 23:14:56,141 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:56,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2018-11-28 23:14:56,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:14:56,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:14:56,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:14:56,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:56,142 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:56,143 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:56,143 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:56,143 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:14:56,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:14:56,143 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:56,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:14:56,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:14:56 BoogieIcfgContainer [2018-11-28 23:14:56,155 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:14:56,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:14:56,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:14:56,156 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:14:56,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:47" (3/4) ... [2018-11-28 23:14:56,162 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:14:56,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:14:56,163 INFO L168 Benchmark]: Toolchain (without parser) took 9570.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 951.4 MB in the beginning and 875.5 MB in the end (delta: 75.9 MB). Peak memory consumption was 288.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:56,165 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:56,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:56,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.01 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:56,168 INFO L168 Benchmark]: Boogie Preprocessor took 23.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:56,168 INFO L168 Benchmark]: RCFGBuilder took 507.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:56,169 INFO L168 Benchmark]: BuchiAutomizer took 8651.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 875.5 MB in the end (delta: 227.0 MB). Peak memory consumption was 310.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:56,170 INFO L168 Benchmark]: Witness Printer took 7.36 ms. Allocated memory is still 1.2 GB. Free memory is still 875.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:56,176 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 41.01 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 507.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8651.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 875.5 MB in the end (delta: 227.0 MB). Peak memory consumption was 310.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.36 ms. Allocated memory is still 1.2 GB. Free memory is still 875.5 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 11 terminating modules (3 trivial, 6 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 * m + -2 * y + 1 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 5 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 * m + -2 * y + 1 and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 6.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 155 SDslu, 81 SDs, 0 SdLazy, 157 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax168 hnf99 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf94 smp100 dnf112 smp100 tf111 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...