./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/PastaA10_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-restricted-15/PastaA10_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 eb84f41e050e85d4fc46b55b68b36040bcbf2911 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:37:13,490 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:37:13,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:37:13,506 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:37:13,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:37:13,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:37:13,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:37:13,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:37:13,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:37:13,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:37:13,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:37:13,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:37:13,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:37:13,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:37:13,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:37:13,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:37:13,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:37:13,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:37:13,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:37:13,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:37:13,544 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:37:13,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:37:13,548 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:37:13,548 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:37:13,548 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:37:13,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:37:13,550 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:37:13,551 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:37:13,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:37:13,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:37:13,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:37:13,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:37:13,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:37:13,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:37:13,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:37:13,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:37:13,557 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:37:13,585 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:37:13,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:37:13,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:37:13,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:37:13,587 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:37:13,589 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:37:13,589 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:37:13,589 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:37:13,589 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:37:13,589 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:37:13,589 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:37:13,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:37:13,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:37:13,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:37:13,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:37:13,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:37:13,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:37:13,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:37:13,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:37:13,591 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:37:13,591 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:37:13,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:37:13,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:37:13,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:37:13,594 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:37:13,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:37:13,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:37:13,595 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:37:13,596 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:37:13,596 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 -> eb84f41e050e85d4fc46b55b68b36040bcbf2911 [2019-01-01 21:37:13,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:37:13,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:37:13,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:37:13,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:37:13,670 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:37:13,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/PastaA10_true-termination_true-no-overflow.c [2019-01-01 21:37:13,736 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcbd4c6f1/90e634930b2a4034b05300ef5ae06149/FLAGe168345f4 [2019-01-01 21:37:14,196 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:37:14,197 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/PastaA10_true-termination_true-no-overflow.c [2019-01-01 21:37:14,206 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcbd4c6f1/90e634930b2a4034b05300ef5ae06149/FLAGe168345f4 [2019-01-01 21:37:14,550 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcbd4c6f1/90e634930b2a4034b05300ef5ae06149 [2019-01-01 21:37:14,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:37:14,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:37:14,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:37:14,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:37:14,560 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:37:14,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e07760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14, skipping insertion in model container [2019-01-01 21:37:14,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:37:14,593 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:37:14,765 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:37:14,770 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:37:14,787 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:37:14,800 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:37:14,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14 WrapperNode [2019-01-01 21:37:14,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:37:14,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:37:14,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:37:14,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:37:14,812 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:37:14" (1/1) ... [2019-01-01 21:37:14,818 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:37:14" (1/1) ... [2019-01-01 21:37:14,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:37:14,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:37:14,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:37:14,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:37:14,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (1/1) ... [2019-01-01 21:37:14,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:37:14,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:37:14,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:37:14,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:37:14,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (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:37:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:37:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:37:15,130 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:37:15,130 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:37:15,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:15 BoogieIcfgContainer [2019-01-01 21:37:15,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:37:15,132 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:37:15,132 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:37:15,136 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:37:15,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:15,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:37:14" (1/3) ... [2019-01-01 21:37:15,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ab8d3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:37:15, skipping insertion in model container [2019-01-01 21:37:15,138 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:15,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:14" (2/3) ... [2019-01-01 21:37:15,139 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ab8d3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:37:15, skipping insertion in model container [2019-01-01 21:37:15,139 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:15,139 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:15" (3/3) ... [2019-01-01 21:37:15,141 INFO L375 chiAutomizerObserver]: Analyzing ICFG PastaA10_true-termination_true-no-overflow.c [2019-01-01 21:37:15,197 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:37:15,198 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:37:15,198 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:37:15,198 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:37:15,198 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:37:15,199 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:37:15,199 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:37:15,199 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:37:15,200 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:37:15,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:37:15,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:15,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:15,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:15,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:37:15,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:15,241 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:37:15,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:37:15,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:15,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:15,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:15,243 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:37:15,243 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:15,252 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; 3#L12-2true [2019-01-01 21:37:15,253 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~x~0 != main_~y~0); 5#L12true assume main_~x~0 > main_~y~0;main_~y~0 := 1 + main_~y~0; 3#L12-2true [2019-01-01 21:37:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:37:15,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:15,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:15,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:37:15,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:15,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:15,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:15,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:15,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:37:15,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:15,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:15,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:15,505 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-01 21:37:15,612 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:15,614 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:15,614 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:15,614 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:15,615 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:15,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:15,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:15,615 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:15,615 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:37:15,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:15,616 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:15,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:15,684 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:37:15,690 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:37:15,810 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:15,811 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:15,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:15,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:15,860 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:15,860 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:15,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:15,869 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:15,893 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:15,893 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:37:15,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:15,905 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:37:15,931 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:15,931 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:16,079 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:16,081 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:16,082 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:16,082 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:16,082 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:16,082 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:16,082 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:16,082 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:16,082 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:16,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:37:16,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:16,083 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:16,085 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:37:16,108 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:37:16,146 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:37:16,442 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:16,448 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:16,450 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:37:16,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:16,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:16,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:16,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:16,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:16,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:16,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:16,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:37:16,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:16,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:16,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:16,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:16,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:16,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:16,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:16,484 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:37:16,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:16,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:16,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:16,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:16,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:16,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:16,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:16,495 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:16,504 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:37:16,504 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:16,507 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:16,507 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:16,507 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:16,508 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~x~0 - 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:37:16,510 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:16,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:16,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:16,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:16,631 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:37:16,646 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:37:16,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:37:16,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-01-01 21:37:16,774 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:37:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:37:16,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:37:16,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:16,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:37:16,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:16,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:37:16,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:16,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 21:37:16,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:16,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-01 21:37:16,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:16,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:37:16,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-01 21:37:16,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:16,796 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-01 21:37:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:37:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:37:16,833 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:16,833 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:16,833 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:37:16,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:37:16,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:16,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:16,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:16,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:37:16,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:16,836 INFO L794 eck$LassoCheckResult]: Stem: 68#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; 69#L12-2 assume !!(main_~x~0 != main_~y~0); 67#L12 assume !(main_~x~0 > main_~y~0);main_~x~0 := 1 + main_~x~0; 63#L12-2 [2019-01-01 21:37:16,836 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~x~0 != main_~y~0); 64#L12 assume main_~x~0 > main_~y~0;main_~y~0 := 1 + main_~y~0; 63#L12-2 [2019-01-01 21:37:16,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:16,838 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-01 21:37:16,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:16,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:16,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-01 21:37:16,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:16,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:16,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:16,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-01 21:37:16,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:16,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:16,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:17,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:37:17,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:37:17,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:17,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:17,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:37:17,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 21:37:17,194 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:17,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:17,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:17,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:17,195 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:17,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:17,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:17,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:17,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:37:17,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:17,196 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:17,198 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:37:17,205 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:37:17,290 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:37:17,421 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:17,421 INFO L412 LassoAnalysis]: Checking for nontermination... 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:37:17,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:17,425 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:17,446 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:17,447 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 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:37:17,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:17,452 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:37:17,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:17,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:17,615 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:17,618 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:17,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:17,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:17,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:17,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:17,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:17,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:17,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:17,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:37:17,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:17,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:17,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:17,635 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:37:17,644 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:37:17,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:17,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:17,754 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:37:17,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:17,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:17,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:17,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:17,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:17,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:17,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:17,763 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:17,768 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:17,768 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:17,768 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:17,768 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:17,769 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:17,769 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:37:17,769 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:17,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:17,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:17,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:17,938 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:37:17,939 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:37:17,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:37:18,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-01 21:37:18,040 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:37:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:37:18,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:37:18,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:18,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:37:18,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:18,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:37:18,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:18,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-01 21:37:18,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:18,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:37:18,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:37:18,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:37:18,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-01 21:37:18,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:18,048 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:37:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-01 21:37:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:37:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:37:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:37:18,051 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:37:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:37:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:37:18,057 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 4 states. [2019-01-01 21:37:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:37:18,297 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-01 21:37:18,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:37:18,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-01-01 21:37:18,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:18,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 11 transitions. [2019-01-01 21:37:18,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:37:18,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:37:18,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-01 21:37:18,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:18,304 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-01 21:37:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-01 21:37:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-01 21:37:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:37:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-01 21:37:18,306 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:37:18,306 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:37:18,306 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:37:18,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-01 21:37:18,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:18,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:18,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:18,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:37:18,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:18,309 INFO L794 eck$LassoCheckResult]: Stem: 157#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; 158#L12-2 assume !!(main_~x~0 != main_~y~0); 154#L12 [2019-01-01 21:37:18,310 INFO L796 eck$LassoCheckResult]: Loop: 154#L12 assume !(main_~x~0 > main_~y~0);main_~x~0 := 1 + main_~x~0; 153#L12-2 assume !!(main_~x~0 != main_~y~0); 154#L12 [2019-01-01 21:37:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:37:18,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:18,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:18,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:18,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2019-01-01 21:37:18,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:18,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:18,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:18,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:18,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 2 times [2019-01-01 21:37:18,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:18,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:18,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:18,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:18,461 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:18,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:18,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:18,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:18,462 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:18,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:18,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:18,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:18,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:37:18,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:18,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:18,464 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:37:18,481 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:37:18,488 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:37:18,692 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 15 [2019-01-01 21:37:18,705 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:18,706 INFO L412 LassoAnalysis]: Checking for nontermination... 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:37:18,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:18,714 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:37:18,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:18,739 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:21,021 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:21,023 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:21,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:21,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:21,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:21,024 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:21,024 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:21,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:21,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:21,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:37:21,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:21,025 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:21,029 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:37:21,045 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:37:21,052 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:37:21,148 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:21,148 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:21,149 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:37:21,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:21,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:21,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:21,150 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:37:21,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:21,151 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:37:21,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:21,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:21,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:21,168 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:37:21,169 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:21,169 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:21,169 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:21,169 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~y~0 - 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-01 21:37:21,170 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:21,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:21,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:21,330 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:37:21,330 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:37:21,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:37:21,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 11 states and 13 transitions. Complement of second has 5 states. [2019-01-01 21:37:21,351 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:37:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:37:21,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:37:21,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:21,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:21,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:21,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:37:21,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:21,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:37:21,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:21,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2019-01-01 21:37:21,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:21,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:37:21,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-01 21:37:21,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:21,357 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:37:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-01 21:37:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-01 21:37:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:37:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 21:37:21,358 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:37:21,358 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:37:21,359 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:37:21,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-01 21:37:21,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:21,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:21,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:21,360 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-01 21:37:21,360 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:21,360 INFO L794 eck$LassoCheckResult]: Stem: 207#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; 203#L12-2 assume !!(main_~x~0 != main_~y~0); 204#L12 assume main_~x~0 > main_~y~0;main_~y~0 := 1 + main_~y~0; 205#L12-2 assume !!(main_~x~0 != main_~y~0); 206#L12 [2019-01-01 21:37:21,360 INFO L796 eck$LassoCheckResult]: Loop: 206#L12 assume !(main_~x~0 > main_~y~0);main_~x~0 := 1 + main_~x~0; 208#L12-2 assume !!(main_~x~0 != main_~y~0); 206#L12 [2019-01-01 21:37:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:21,361 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-01 21:37:21,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:21,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:21,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:21,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:21,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:21,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-01 21:37:21,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:21,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:21,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:21,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:21,377 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 2 times [2019-01-01 21:37:21,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:21,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:21,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:21,443 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:37:21,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:37:21,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:37:21,482 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:21,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:21,482 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:21,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:21,483 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:21,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:21,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:21,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:21,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:37:21,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:21,483 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:21,485 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:37:21,492 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:37:21,502 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:37:21,666 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 15 [2019-01-01 21:37:21,674 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:21,674 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:37:21,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:21,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:21,700 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:21,700 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:37:21,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:21,705 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:21,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:21,732 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:24,384 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:24,386 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:24,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:24,387 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:24,387 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:24,387 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:24,387 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:24,387 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:24,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:24,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:37:24,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:24,388 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:24,389 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:37:24,401 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:37:24,412 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:37:24,553 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:24,553 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:24,555 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:37:24,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:24,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:24,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:24,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:24,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:24,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:24,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:24,576 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:37:24,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:24,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:24,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:24,580 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:37:24,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:24,581 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:37:24,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:24,588 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:24,593 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:24,593 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:37:24,594 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:24,594 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:24,594 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:24,594 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~y~0 - 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-01 21:37:24,595 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:24,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:24,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:24,706 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:37:24,706 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:37:24,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:37:24,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 3 states. [2019-01-01 21:37:24,712 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:37:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2019-01-01 21:37:24,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:24,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:24,713 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:24,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:24,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:24,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:24,814 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:37:24,815 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:37:24,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:37:24,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 3 states. [2019-01-01 21:37:24,823 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:37:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2019-01-01 21:37:24,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:24,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:24,824 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:24,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:24,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:24,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:24,878 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:37:24,879 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:37:24,879 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:37:24,898 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 4 states. [2019-01-01 21:37:24,904 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:37:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:37:24,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:24,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:24,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:37:24,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:24,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:37:24,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:24,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-01-01 21:37:24,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:24,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2019-01-01 21:37:24,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:37:24,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:37:24,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:37:24,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:37:24,909 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:24,909 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:24,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:37:24,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:37:24,910 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-01 21:37:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:37:24,910 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 21:37:24,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:37:24,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 21:37:24,910 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:24,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:37:24,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:37:24,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:37:24,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:37:24,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:37:24,911 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:24,911 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:24,911 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:24,912 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:37:24,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:37:24,912 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:24,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:37:24,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:37:24 BoogieIcfgContainer [2019-01-01 21:37:24,920 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:37:24,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:37:24,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:37:24,921 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:37:24,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:15" (3/4) ... [2019-01-01 21:37:24,925 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:37:24,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:37:24,926 INFO L168 Benchmark]: Toolchain (without parser) took 10371.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 942.0 MB in the beginning and 841.0 MB in the end (delta: 101.0 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:24,927 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:24,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.25 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 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:37:24,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.54 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:24,929 INFO L168 Benchmark]: Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:24,930 INFO L168 Benchmark]: RCFGBuilder took 272.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:24,931 INFO L168 Benchmark]: BuchiAutomizer took 9788.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 841.0 MB in the end (delta: 264.9 MB). Peak memory consumption was 264.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:24,932 INFO L168 Benchmark]: Witness Printer took 4.71 ms. Allocated memory is still 1.2 GB. Free memory is still 841.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:24,936 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.25 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 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 36.54 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 272.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9788.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 841.0 MB in the end (delta: 264.9 MB). Peak memory consumption was 264.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.71 ms. Allocated memory is still 1.2 GB. Free memory is still 841.0 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 x + -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One deterministic module has affine ranking function 2 * y + -2 * x + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * y + -2 * x + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 8.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. 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 7 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 18 SDslu, 3 SDs, 0 SdLazy, 43 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 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf132 smp89 tf110 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...