./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 0ed9222f 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-0ed9222-m [2019-01-14 02:19:43,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:19:43,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:19:43,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:19:43,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:19:43,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:19:43,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:19:43,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:19:43,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:19:43,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:19:43,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:19:43,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:19:43,266 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:19:43,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:19:43,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:19:43,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:19:43,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:19:43,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:19:43,275 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:19:43,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:19:43,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:19:43,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:19:43,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:19:43,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:19:43,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:19:43,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:19:43,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:19:43,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:19:43,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:19:43,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:19:43,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:19:43,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:19:43,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:19:43,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:19:43,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:19:43,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:19:43,295 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:19:43,311 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:19:43,312 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:19:43,314 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:19:43,314 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:19:43,314 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:19:43,314 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:19:43,315 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:19:43,315 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:19:43,315 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:19:43,315 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:19:43,315 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:19:43,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:19:43,317 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:19:43,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:19:43,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:19:43,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:19:43,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:19:43,318 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:19:43,318 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:19:43,319 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:19:43,319 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:19:43,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:19:43,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:19:43,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:19:43,320 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:19:43,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:19:43,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:19:43,320 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:19:43,321 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:19:43,321 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-14 02:19:43,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:19:43,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:19:43,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:19:43,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:19:43,384 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:19:43,385 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-14 02:19:43,454 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea8d4e4a/af4ad6b765da4ebc981b91410a4781e7/FLAG5e1e54590 [2019-01-14 02:19:43,887 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:19:43,888 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/PastaA10_true-termination_true-no-overflow.c [2019-01-14 02:19:43,895 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea8d4e4a/af4ad6b765da4ebc981b91410a4781e7/FLAG5e1e54590 [2019-01-14 02:19:44,253 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea8d4e4a/af4ad6b765da4ebc981b91410a4781e7 [2019-01-14 02:19:44,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:19:44,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:19:44,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:44,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:19:44,263 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:19:44,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f785cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44, skipping insertion in model container [2019-01-14 02:19:44,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:19:44,294 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:19:44,522 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:44,528 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:19:44,545 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:44,561 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:19:44,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44 WrapperNode [2019-01-14 02:19:44,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:44,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:44,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:19:44,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:19:44,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:44,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:19:44,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:19:44,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:19:44,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (1/1) ... [2019-01-14 02:19:44,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:19:44,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:19:44,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:19:44,624 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:19:44,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (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-14 02:19:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:19:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:19:44,902 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:19:44,902 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:19:44,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:44 BoogieIcfgContainer [2019-01-14 02:19:44,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:19:44,904 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:19:44,904 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:19:44,908 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:19:44,909 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:44,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:19:44" (1/3) ... [2019-01-14 02:19:44,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fdef1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:44, skipping insertion in model container [2019-01-14 02:19:44,911 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:44,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:44" (2/3) ... [2019-01-14 02:19:44,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fdef1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:44, skipping insertion in model container [2019-01-14 02:19:44,912 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:44,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:44" (3/3) ... [2019-01-14 02:19:44,914 INFO L375 chiAutomizerObserver]: Analyzing ICFG PastaA10_true-termination_true-no-overflow.c [2019-01-14 02:19:44,974 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:19:44,975 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:19:44,975 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:19:44,975 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:19:44,976 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:19:44,976 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:19:44,976 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:19:44,976 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:19:44,976 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:19:44,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:19:45,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:45,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:45,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:45,019 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:45,019 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:45,019 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:19:45,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:19:45,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:45,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:45,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:45,021 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:45,021 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:45,029 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-14 02:19:45,030 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-14 02:19:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:45,037 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:19:45,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:45,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:45,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-14 02:19:45,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:45,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:45,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:45,146 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-14 02:19:45,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:45,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:45,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:45,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:45,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:45,335 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-14 02:19:45,388 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:45,390 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:45,390 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:45,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:45,391 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:45,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:45,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:45,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:45,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:19:45,392 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:45,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:45,419 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-14 02:19:45,449 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-14 02:19:45,456 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-14 02:19:45,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:45,587 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:19:45,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:45,601 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:45,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:45,636 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-14 02:19:45,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:45,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:45,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:45,667 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) [2019-01-14 02:19:45,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:45,676 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 02:19:45,704 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:45,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:45,847 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:45,848 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:45,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:45,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:45,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:45,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:45,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:45,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:45,850 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:45,850 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:19:45,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:45,850 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:45,852 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-14 02:19:45,879 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-14 02:19:45,919 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-14 02:19:46,117 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:19:46,204 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:46,210 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:46,212 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-14 02:19:46,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:46,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:46,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:46,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:46,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:46,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:46,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:46,232 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-14 02:19:46,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:46,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:46,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:46,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:46,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:46,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:46,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:46,246 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-14 02:19:46,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:46,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:46,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:46,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:46,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:46,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:46,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:46,257 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:46,266 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:19:46,266 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:46,268 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:46,269 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:46,269 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:46,269 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-14 02:19:46,271 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:46,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:46,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:46,392 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-14 02:19:46,405 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-14 02:19:46,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-14 02:19:46,477 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-14 02:19:46,478 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-14 02:19:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:19:46,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:19:46,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:46,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:19:46,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:46,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:19:46,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:46,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:19:46,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:46,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:19:46,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:19:46,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:19:46,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:19:46,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:46,497 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:19:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:19:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:19:46,524 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:46,524 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:46,524 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:19:46,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:19:46,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:46,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:46,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:46,526 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:19:46,526 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:46,526 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-14 02:19:46,527 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-14 02:19:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-14 02:19:46,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:46,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:46,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-14 02:19:46,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:46,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:46,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:46,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-14 02:19:46,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:46,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:46,619 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-14 02:19:46,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:19:46,621 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-14 02:19:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:46,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:46,680 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-14 02:19:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:19:46,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 02:19:46,814 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:46,814 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:46,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:46,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:46,815 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:46,815 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:46,815 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:46,815 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:46,815 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:46,815 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:46,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:46,817 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-14 02:19:46,841 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-14 02:19:46,855 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-14 02:19:46,945 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:46,946 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-14 02:19:46,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:46,952 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:46,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:46,972 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-14 02:19:46,977 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:46,978 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-14 02:19:47,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:47,005 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:47,126 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:47,128 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:47,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:47,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:47,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:47,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:47,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:47,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:47,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:47,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:47,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:47,130 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:47,132 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-14 02:19:47,150 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-14 02:19:47,158 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-14 02:19:47,254 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:47,254 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:47,255 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-14 02:19:47,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:47,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:47,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:47,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:47,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:47,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:47,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:47,266 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:47,271 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:47,271 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:47,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:47,272 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:47,272 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:47,272 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-14 02:19:47,273 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:47,421 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-14 02:19:47,422 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-14 02:19:47,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:19:47,457 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-14 02:19:47,459 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-14 02:19:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:19:47,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:19:47,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:47,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:19:47,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:47,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:19:47,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:47,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-14 02:19:47,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:47,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:19:47,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:19:47,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:19:47,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-14 02:19:47,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:47,464 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:19:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-14 02:19:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:19:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:19:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:19:47,466 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:19:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:19:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:19:47,471 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 4 states. [2019-01-14 02:19:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:47,534 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-14 02:19:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:19:47,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-01-14 02:19:47,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:47,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 11 transitions. [2019-01-14 02:19:47,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:19:47,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:19:47,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-14 02:19:47,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:47,538 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:19:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-14 02:19:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-14 02:19:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:19:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-14 02:19:47,542 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:19:47,542 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:19:47,542 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:19:47,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-14 02:19:47,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:47,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:47,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:47,544 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:19:47,544 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:47,545 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-14 02:19:47,545 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-14 02:19:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:19:47,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:47,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2019-01-14 02:19:47,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:47,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:47,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:47,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 2 times [2019-01-14 02:19:47,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:47,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,645 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:47,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:47,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:47,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:47,646 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:47,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:47,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:47,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:47,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:47,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:47,647 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:47,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:47,660 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-14 02:19:47,663 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-14 02:19:47,873 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:47,873 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) [2019-01-14 02:19:47,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:47,879 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:19:47,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:47,948 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:50,683 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:50,686 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:50,687 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:50,687 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:50,687 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:50,687 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:50,687 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:50,687 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:50,688 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:50,688 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:50,688 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:50,688 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:50,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-14 02:19:50,711 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-14 02:19:50,714 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-14 02:19:50,840 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:50,840 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:50,841 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-14 02:19:50,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:50,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:50,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:50,842 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:19:50,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:50,844 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:19:50,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:50,853 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:50,860 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:50,861 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:19:50,862 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:50,862 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:50,862 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:50,862 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-14 02:19:50,863 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:50,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:50,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:51,029 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-14 02:19:51,029 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-14 02:19:51,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:19:51,047 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-14 02:19:51,048 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-14 02:19:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:51,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:19:51,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:51,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:19:51,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:51,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:19:51,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:51,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:19:51,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:51,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2019-01-14 02:19:51,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:19:51,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:19:51,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-14 02:19:51,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:51,052 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:19:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-14 02:19:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-14 02:19:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:19:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 02:19:51,054 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:19:51,054 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:19:51,054 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:19:51,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-14 02:19:51,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:51,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:51,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:51,055 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-14 02:19:51,055 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:51,056 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-14 02:19:51,056 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-14 02:19:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-14 02:19:51,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:51,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:51,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:51,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-14 02:19:51,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:51,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:51,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:51,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:51,081 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 2 times [2019-01-14 02:19:51,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:51,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:51,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:51,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:51,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:51,169 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-14 02:19:51,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:51,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:19:51,204 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:51,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:51,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:51,204 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:51,205 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:51,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:51,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:51,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:51,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:51,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:51,205 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:51,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:51,211 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-14 02:19:51,225 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-14 02:19:51,401 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 15 [2019-01-14 02:19:51,409 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:51,410 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) [2019-01-14 02:19:51,419 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:51,420 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:51,443 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:51,443 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-14 02:19:51,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:51,450 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-14 02:19:51,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:51,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:54,133 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:54,135 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:54,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:54,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:54,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:54,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:54,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:54,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:54,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:54,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA10_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:54,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:54,137 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:54,138 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-14 02:19:54,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:54,199 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-14 02:19:54,287 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:54,287 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:54,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:54,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:54,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:54,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:54,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:54,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:54,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:54,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:54,299 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-14 02:19:54,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:54,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:54,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:54,302 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:19:54,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:54,305 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:19:54,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:54,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:54,319 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:54,319 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:19:54,320 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:54,320 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:54,320 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:54,320 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-14 02:19:54,321 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:54,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:54,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:54,416 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-14 02:19:54,417 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-14 02:19:54,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:19:54,436 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-14 02:19:54,437 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-14 02:19:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2019-01-14 02:19:54,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:19:54,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:54,438 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:54,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:54,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:54,520 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-14 02:19:54,521 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-14 02:19:54,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:19:54,532 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-14 02:19:54,534 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-14 02:19:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2019-01-14 02:19:54,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:19:54,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:54,535 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:54,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:54,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:54,594 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-14 02:19:54,595 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-14 02:19:54,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:19:54,614 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-14 02:19:54,619 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-14 02:19:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:19:54,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:19:54,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:54,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:19:54,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:54,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:19:54,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:54,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-01-14 02:19:54,624 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:54,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2019-01-14 02:19:54,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:54,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:54,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:54,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:54,624 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:54,624 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:19:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:19:54,625 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-14 02:19:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:54,625 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:19:54,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:19:54,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:19:54,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:54,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:19:54,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:54,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:54,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:54,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:54,629 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:54,629 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:54,629 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:54,630 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:19:54,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:19:54,631 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:54,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:19:54,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:19:54 BoogieIcfgContainer [2019-01-14 02:19:54,641 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:19:54,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:19:54,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:19:54,643 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:19:54,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:44" (3/4) ... [2019-01-14 02:19:54,651 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:19:54,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:19:54,652 INFO L168 Benchmark]: Toolchain (without parser) took 10394.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 952.7 MB in the beginning and 803.3 MB in the end (delta: 149.4 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:54,654 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:54,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.34 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:54,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.04 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:54,656 INFO L168 Benchmark]: Boogie Preprocessor took 22.10 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:54,657 INFO L168 Benchmark]: RCFGBuilder took 280.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:54,660 INFO L168 Benchmark]: BuchiAutomizer took 9737.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 803.3 MB in the end (delta: 271.6 MB). Peak memory consumption was 271.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:54,661 INFO L168 Benchmark]: Witness Printer took 8.92 ms. Allocated memory is still 1.1 GB. Free memory is still 803.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:54,666 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.34 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.04 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.10 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 280.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9737.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 803.3 MB in the end (delta: 271.6 MB). Peak memory consumption was 271.6 MB. Max. memory is 11.5 GB. * Witness Printer took 8.92 ms. Allocated memory is still 1.1 GB. Free memory is still 803.3 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.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 8.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. 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.1s 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: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...