./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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-wise_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 4c761fb15c9d367876fc9f1553874e9680fa1668 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:33:49,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:49,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:49,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:49,647 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:49,648 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:49,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:49,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:49,653 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:49,654 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:49,655 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:49,655 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:49,656 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:49,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:49,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:49,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:49,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:49,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:49,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:49,666 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:49,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:49,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:49,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:49,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:49,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:49,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:49,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:49,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:49,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:49,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:49,679 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:49,680 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:49,680 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:49,680 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:49,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:49,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:49,682 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:33:49,702 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:49,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:49,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:49,704 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:49,704 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:49,704 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:49,704 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:49,705 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:49,705 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:49,705 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:49,705 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:49,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:49,706 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:49,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:49,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:49,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:49,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:49,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:49,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:49,707 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:49,707 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:49,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:49,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:49,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:49,708 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:49,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:49,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:49,709 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:49,710 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:49,710 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 -> 4c761fb15c9d367876fc9f1553874e9680fa1668 [2019-01-01 21:33:49,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:49,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:49,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:49,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:49,770 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:49,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2019-01-01 21:33:49,844 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21a9ef44d/736e378fef254837a4b6340134f16133/FLAG0d23438af [2019-01-01 21:33:50,326 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:50,327 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2019-01-01 21:33:50,335 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21a9ef44d/736e378fef254837a4b6340134f16133/FLAG0d23438af [2019-01-01 21:33:50,671 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21a9ef44d/736e378fef254837a4b6340134f16133 [2019-01-01 21:33:50,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:50,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:50,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:50,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:50,684 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:50,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:50" (1/1) ... [2019-01-01 21:33:50,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161817f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:50, skipping insertion in model container [2019-01-01 21:33:50,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:50" (1/1) ... [2019-01-01 21:33:50,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:50,722 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:50,991 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:50,998 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:51,025 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:51,045 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:51,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51 WrapperNode [2019-01-01 21:33:51,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:51,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:51,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:51,047 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:51,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:51,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:51,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:51,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:51,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:51,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:51,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:51,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:51,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (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 [2019-01-01 21:33:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:51,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:51,482 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:51,483 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:33:51,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:51 BoogieIcfgContainer [2019-01-01 21:33:51,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:51,484 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:51,485 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:51,489 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:51,491 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:51,491 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:50" (1/3) ... [2019-01-01 21:33:51,492 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c1c2082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:51, skipping insertion in model container [2019-01-01 21:33:51,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:51,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51" (2/3) ... [2019-01-01 21:33:51,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c1c2082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:51, skipping insertion in model container [2019-01-01 21:33:51,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:51,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:51" (3/3) ... [2019-01-01 21:33:51,496 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2019-01-01 21:33:51,566 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:51,567 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:51,567 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:51,567 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:51,567 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:51,568 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:51,568 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:51,568 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:51,568 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:51,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:51,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:51,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:51,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:51,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:51,620 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:51,620 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:51,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:51,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:51,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:51,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:51,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:51,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:51,631 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L17true assume main_~x~0 >= 0 && main_~y~0 >= 0; 7#L19-2true [2019-01-01 21:33:51,632 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 9#L19true assume main_~x~0 < main_~y~0;main_~x~0 := 1 + main_~x~0; 7#L19-2true [2019-01-01 21:33:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:51,639 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-01 21:33:51,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:51,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:51,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:51,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2019-01-01 21:33:51,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:51,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:51,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:51,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2019-01-01 21:33:51,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:51,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:51,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:51,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:51,982 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-01 21:33:52,047 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:52,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:52,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:52,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:52,049 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:52,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:52,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:52,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:52,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:52,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:52,050 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:52,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,252 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:52,253 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) [2019-01-01 21:33:52,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:52,267 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:52,317 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:52,318 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) [2019-01-01 21:33:52,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:52,330 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:52,352 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:52,353 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 [2019-01-01 21:33:52,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:52,359 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:52,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:52,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:52,526 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:52,529 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:52,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:52,529 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:52,529 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:52,530 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:52,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:52,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:52,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:52,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:52,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:52,530 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:52,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:52,946 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:52,951 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:52,953 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 [2019-01-01 21:33:52,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:52,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:52,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:52,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:52,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:52,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:52,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:52,970 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 [2019-01-01 21:33:52,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:52,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:52,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:52,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:52,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:52,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:52,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:52,985 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 [2019-01-01 21:33:52,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:52,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:52,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:52,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:52,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:52,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:52,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:52,998 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:53,015 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:33:53,015 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:53,018 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:53,018 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:53,019 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:53,019 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~y~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:33:53,021 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:53,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:53,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:53,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:33:53,397 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-01 21:33:53,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 6 states. [2019-01-01 21:33:53,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:33:53,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:33:53,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:53,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:53,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:53,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:53,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:53,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-01 21:33:53,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:53,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2019-01-01 21:33:53,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:53,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:33:53,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-01 21:33:53,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:53,501 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-01 21:33:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-01 21:33:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:33:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-01 21:33:53,531 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:53,531 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:53,532 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:53,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-01-01 21:33:53,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:53,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:53,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:53,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:33:53,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:53,534 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 73#L17 assume main_~x~0 >= 0 && main_~y~0 >= 0; 74#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 79#L19 assume !(main_~x~0 < main_~y~0);main_~y~0 := 1 + main_~y~0; 75#L19-2 [2019-01-01 21:33:53,534 INFO L796 eck$LassoCheckResult]: Loop: 75#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 76#L19 assume main_~x~0 < main_~y~0;main_~x~0 := 1 + main_~x~0; 75#L19-2 [2019-01-01 21:33:53,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:53,534 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2019-01-01 21:33:53,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:53,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:53,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2019-01-01 21:33:53,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:53,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:53,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:53,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash 920231916, now seen corresponding path program 1 times [2019-01-01 21:33:53,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:53,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:53,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:53,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:53,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:33:53,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:33:53,855 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:53,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:53,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:53,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:53,856 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:53,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:53,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:53,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:53,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:53,857 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:53,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:53,953 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:53,954 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:53,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:53,981 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:53,981 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:53,986 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 21:33:54,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:54,017 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:54,175 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:54,178 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:54,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:54,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:54,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:54,179 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:54,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:54,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:54,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:54,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:54,180 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:54,180 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:54,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:54,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:54,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:54,455 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:54,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:54,457 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 [2019-01-01 21:33:54,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:54,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:54,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:54,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:54,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:54,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:54,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:54,469 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 [2019-01-01 21:33:54,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:54,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:54,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:54,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:54,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:54,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:54,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:54,480 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:54,486 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:54,486 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:54,487 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:54,487 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:54,487 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:54,487 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~y~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:33:54,489 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:54,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:54,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:54,789 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:33:54,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:33:54,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 17 transitions. Complement of second has 5 states. [2019-01-01 21:33:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:33:54,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:54,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:54,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:33:54,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2019-01-01 21:33:54,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:54,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 21:33:54,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:54,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:54,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-01-01 21:33:54,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:54,900 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:54,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-01-01 21:33:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 21:33:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:33:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 21:33:54,905 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:54,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:33:54,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:33:54,911 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 5 states. [2019-01-01 21:33:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:55,089 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-01 21:33:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:33:55,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:33:55,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:55,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 12 transitions. [2019-01-01 21:33:55,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:33:55,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:55,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2019-01-01 21:33:55,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:55,096 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:33:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2019-01-01 21:33:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-01 21:33:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:33:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:33:55,099 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:33:55,099 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:33:55,099 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:55,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-01 21:33:55,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:55,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:55,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:55,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:33:55,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:55,103 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 157#L17 assume main_~x~0 >= 0 && main_~y~0 >= 0; 158#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 160#L19 [2019-01-01 21:33:55,103 INFO L796 eck$LassoCheckResult]: Loop: 160#L19 assume !(main_~x~0 < main_~y~0);main_~y~0 := 1 + main_~y~0; 159#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 160#L19 [2019-01-01 21:33:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash 30889, now seen corresponding path program 1 times [2019-01-01 21:33:55,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:55,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:55,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:55,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 1 times [2019-01-01 21:33:55,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:55,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:55,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:55,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:55,137 INFO L82 PathProgramCache]: Analyzing trace with hash 29684900, now seen corresponding path program 2 times [2019-01-01 21:33:55,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:55,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:55,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:55,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,197 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:55,197 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:55,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:55,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:55,198 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:55,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:55,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:55,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:55,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:55,198 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:55,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:55,315 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-01 21:33:55,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:55,320 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:55,343 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:55,343 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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 [2019-01-01 21:33:55,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:55,354 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 21:33:55,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:55,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:55,678 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:55,681 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:55,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:55,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:55,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:55,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:55,682 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:55,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:55,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:55,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:55,687 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:55,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:55,810 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:55,810 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:55,811 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 [2019-01-01 21:33:55,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:55,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:55,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:55,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:55,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:55,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:55,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:55,819 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:55,824 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:33:55,824 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:55,825 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:55,825 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:55,825 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:55,825 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:33:55,826 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:55,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:55,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:55,929 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:55,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:33:55,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 12 states and 14 transitions. Complement of second has 5 states. [2019-01-01 21:33:55,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:55,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:33:55,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:55,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:55,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:55,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:33:55,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:55,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-01 21:33:55,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:55,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2019-01-01 21:33:55,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:55,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:55,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-01-01 21:33:55,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:55,953 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-01 21:33:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-01-01 21:33:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-01 21:33:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:33:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-01 21:33:55,955 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:33:55,955 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:33:55,955 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:55,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-01-01 21:33:55,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:55,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:55,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:55,956 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-01 21:33:55,956 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:55,957 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 212#L17 assume main_~x~0 >= 0 && main_~y~0 >= 0; 213#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 214#L19 assume main_~x~0 < main_~y~0;main_~x~0 := 1 + main_~x~0; 215#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 216#L19 [2019-01-01 21:33:55,957 INFO L796 eck$LassoCheckResult]: Loop: 216#L19 assume !(main_~x~0 < main_~y~0);main_~y~0 := 1 + main_~y~0; 217#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 216#L19 [2019-01-01 21:33:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash 29684838, now seen corresponding path program 2 times [2019-01-01 21:33:55,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:55,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:55,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:55,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 2 times [2019-01-01 21:33:55,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:55,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:55,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1537641183, now seen corresponding path program 2 times [2019-01-01 21:33:55,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:55,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:56,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:33:56,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:33:56,112 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:56,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:56,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:56,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:56,113 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:56,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:56,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:56,114 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:56,114 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:56,114 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:56,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,207 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:56,208 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:56,213 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 21:33:56,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:56,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:56,542 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:56,545 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:56,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:56,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:56,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:56,545 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:56,545 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:56,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:56,546 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:56,546 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:56,546 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:56,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:56,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:56,667 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:56,668 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 [2019-01-01 21:33:56,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:56,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:56,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:56,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:56,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:56,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:56,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:56,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:56,694 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:33:56,695 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:56,695 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:56,695 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:56,696 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:56,696 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:33:56,696 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:56,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:56,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:33:56,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 3 states. [2019-01-01 21:33:56,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2019-01-01 21:33:56,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:56,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,848 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:56,899 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:56,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:33:56,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 3 states. [2019-01-01 21:33:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2019-01-01 21:33:56,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:56,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,909 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:56,957 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 2 loop predicates [2019-01-01 21:33:56,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:33:56,977 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 9 states and 10 transitions. Complement of second has 4 states. [2019-01-01 21:33:56,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:33:56,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:56,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:33:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:33:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-01 21:33:56,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:56,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-01 21:33:56,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:56,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:56,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:56,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:56,984 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:56,984 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:33:56,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:33:56,985 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 21:33:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:56,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 21:33:56,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:33:56,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 21:33:56,986 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:56,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:33:56,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:56,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:56,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:56,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:56,989 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:56,989 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:56,989 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:56,989 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:56,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:56,989 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:56,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:56,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:56 BoogieIcfgContainer [2019-01-01 21:33:56,996 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:56,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:56,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:56,997 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:56,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:51" (3/4) ... [2019-01-01 21:33:57,002 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:57,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:57,003 INFO L168 Benchmark]: Toolchain (without parser) took 6327.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 952.7 MB in the beginning and 864.1 MB in the end (delta: 88.6 MB). Peak memory consumption was 215.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:57,005 INFO L168 Benchmark]: CDTParser took 0.18 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. [2019-01-01 21:33:57,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.97 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:57,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.99 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:57,007 INFO L168 Benchmark]: Boogie Preprocessor took 21.17 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:57,008 INFO L168 Benchmark]: RCFGBuilder took 377.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:57,009 INFO L168 Benchmark]: BuchiAutomizer took 5512.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 864.1 MB in the end (delta: 241.6 MB). Peak memory consumption was 241.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:57,009 INFO L168 Benchmark]: Witness Printer took 5.66 ms. Allocated memory is still 1.2 GB. Free memory is still 864.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:57,014 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.18 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 366.97 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 37.99 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.17 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5512.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 864.1 MB in the end (delta: 241.6 MB). Peak memory consumption was 241.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.66 ms. Allocated memory is still 1.2 GB. Free memory is still 864.1 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y + -1 * x and consists of 4 locations. One deterministic module has affine ranking function y + -1 * x and consists of 3 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 29 SDslu, 3 SDs, 0 SdLazy, 44 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...