./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/c.01_assume_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/c.01_assume_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 da7ccbcfff0bcaf24fe1bd516f01da1d9e0ab2a4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:21:31,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:21:31,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:21:31,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:21:31,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:21:31,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:21:31,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:21:31,685 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:21:31,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:21:31,692 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:21:31,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:21:31,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:21:31,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:21:31,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:21:31,709 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:21:31,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:21:31,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:21:31,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:21:31,726 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:21:31,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:21:31,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:21:31,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:21:31,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:21:31,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:21:31,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:21:31,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:21:31,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:21:31,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:21:31,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:21:31,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:21:31,759 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:21:31,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:21:31,762 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:21:31,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:21:31,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:21:31,766 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:21:31,767 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:21:31,798 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:21:31,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:21:31,801 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:21:31,802 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:21:31,802 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:21:31,803 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:21:31,803 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:21:31,804 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:21:31,804 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:21:31,804 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:21:31,804 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:21:31,804 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:21:31,805 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:21:31,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:21:31,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:21:31,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:21:31,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:21:31,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:21:31,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:21:31,806 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:21:31,806 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:21:31,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:21:31,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:21:31,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:21:31,810 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:21:31,810 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:21:31,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:21:31,810 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:21:31,812 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:21:31,812 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 -> da7ccbcfff0bcaf24fe1bd516f01da1d9e0ab2a4 [2019-01-14 02:21:31,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:21:31,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:21:31,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:21:31,893 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:21:31,893 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:21:31,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/c.01_assume_true-termination_true-no-overflow.c [2019-01-14 02:21:31,957 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4bf6ebc/43e2952552f647eb8f0fdb949b990918/FLAG8621290d1 [2019-01-14 02:21:32,426 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:21:32,427 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/c.01_assume_true-termination_true-no-overflow.c [2019-01-14 02:21:32,436 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4bf6ebc/43e2952552f647eb8f0fdb949b990918/FLAG8621290d1 [2019-01-14 02:21:32,748 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4bf6ebc/43e2952552f647eb8f0fdb949b990918 [2019-01-14 02:21:32,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:21:32,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:21:32,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:21:32,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:21:32,764 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:21:32,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:21:32" (1/1) ... [2019-01-14 02:21:32,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5089c550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:32, skipping insertion in model container [2019-01-14 02:21:32,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:21:32" (1/1) ... [2019-01-14 02:21:32,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:21:32,804 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:21:32,980 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:21:32,984 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:21:33,001 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:21:33,016 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:21:33,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33 WrapperNode [2019-01-14 02:21:33,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:21:33,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:21:33,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:21:33,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:21:33,026 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:21:33" (1/1) ... [2019-01-14 02:21:33,031 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:21:33" (1/1) ... [2019-01-14 02:21:33,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:21:33,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:21:33,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:21:33,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:21:33,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (1/1) ... [2019-01-14 02:21:33,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (1/1) ... [2019-01-14 02:21:33,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (1/1) ... [2019-01-14 02:21:33,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (1/1) ... [2019-01-14 02:21:33,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (1/1) ... [2019-01-14 02:21:33,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (1/1) ... [2019-01-14 02:21:33,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (1/1) ... [2019-01-14 02:21:33,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:21:33,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:21:33,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:21:33,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:21:33,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (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:21:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:21:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:21:33,384 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:21:33,385 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:21:33,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:33 BoogieIcfgContainer [2019-01-14 02:21:33,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:21:33,388 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:21:33,388 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:21:33,392 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:21:33,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:33,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:21:32" (1/3) ... [2019-01-14 02:21:33,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fef0c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:21:33, skipping insertion in model container [2019-01-14 02:21:33,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:33,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:33" (2/3) ... [2019-01-14 02:21:33,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fef0c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:21:33, skipping insertion in model container [2019-01-14 02:21:33,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:33,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:33" (3/3) ... [2019-01-14 02:21:33,396 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume_true-termination_true-no-overflow.c [2019-01-14 02:21:33,457 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:21:33,458 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:21:33,458 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:21:33,459 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:21:33,459 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:21:33,459 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:21:33,459 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:21:33,459 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:21:33,459 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:21:33,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:21:33,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:21:33,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:33,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:33,508 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:33,509 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:21:33,509 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:21:33,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:21:33,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:21:33,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:33,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:33,511 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:33,512 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:21:33,521 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L9-2true [2019-01-14 02:21:33,521 INFO L796 eck$LassoCheckResult]: Loop: 6#L9-2true assume !!(main_~x~0 >= 0 && main_~y~0 > 0);main_~y~0 := 1; 10#L11-2true assume !((main_~x~0 > main_~y~0 && main_~y~0 > 0) && main_~y~0 < 1073741824); 8#L11-3true main_~x~0 := main_~x~0 - 1; 6#L9-2true [2019-01-14 02:21:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:21:33,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:33,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:33,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:33,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:33,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:33,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:21:33,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:33,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:33,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:33,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:33,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-14 02:21:33,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:33,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:33,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:33,901 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-14 02:21:33,969 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:33,971 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:33,971 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:33,971 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:33,971 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:33,972 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:33,972 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:33,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:33,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:21:33,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:33,973 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:33,999 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:21:34,027 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:21:34,039 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:21:34,466 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:21:34,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:34,473 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:34,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:34,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:34,507 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:34,507 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:21:34,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:34,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:34,538 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:34,539 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:34,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:34,545 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:34,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:34,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:34,613 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:34,615 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:34,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:34,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:34,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:34,615 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:34,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:34,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:34,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:34,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:21:34,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:34,617 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:34,619 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:21:34,658 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:21:34,701 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:21:34,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:34,829 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:34,831 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:21:34,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:34,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:34,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:34,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:34,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:34,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:34,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:34,848 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:21:34,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:34,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:34,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:34,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:34,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:34,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:34,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:34,863 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:34,873 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:21:34,873 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:21:34,875 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:34,876 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:34,876 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:34,877 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-14 02:21:34,878 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:34,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:35,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:35,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:35,089 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:21:35,103 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:21:35,105 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-14 02:21:35,205 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 23 states and 35 transitions. Complement of second has 7 states. [2019-01-14 02:21:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:21:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:21:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-14 02:21:35,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:21:35,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:35,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:21:35,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:35,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:21:35,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:35,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. [2019-01-14 02:21:35,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:35,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:21:35,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:21:35,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:21:35,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:21:35,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:21:35,232 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:21:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:21:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-14 02:21:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:21:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-14 02:21:35,267 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:21:35,268 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:21:35,268 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:21:35,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2019-01-14 02:21:35,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:35,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:35,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:35,271 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:21:35,271 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:21:35,271 INFO L794 eck$LassoCheckResult]: Stem: 70#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; 71#L9-2 assume !!(main_~x~0 >= 0 && main_~y~0 > 0);main_~y~0 := 1; 73#L11-2 [2019-01-14 02:21:35,271 INFO L796 eck$LassoCheckResult]: Loop: 73#L11-2 assume !!((main_~x~0 > main_~y~0 && main_~y~0 > 0) && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 73#L11-2 [2019-01-14 02:21:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:21:35,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:35,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:35,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:35,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:21:35,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:35,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:35,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:35,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:35,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:21:35,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:35,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:35,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:35,382 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:35,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:35,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:35,383 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:35,383 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:35,383 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:35,383 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:35,384 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:35,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:21:35,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:35,385 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:35,387 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:21:35,397 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:21:35,433 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:21:35,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:35,530 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:35,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:35,535 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:35,557 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:35,557 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:35,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:35,562 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:35,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:35,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:35,623 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:35,625 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:35,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:35,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:35,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:35,626 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:35,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:35,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:35,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:35,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:21:35,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:35,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:35,631 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:21:35,659 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:21:35,804 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 02:21:35,804 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:21:36,066 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 02:21:36,195 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:36,195 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:36,196 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:21:36,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:36,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:36,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:36,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:36,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:36,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:36,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:36,205 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:21:36,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:36,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:36,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:36,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:36,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:36,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:36,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:36,217 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:36,222 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:21:36,223 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:21:36,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:36,224 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:36,224 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:36,224 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 2147483647 Supporting invariants [] [2019-01-14 02:21:36,225 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:36,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:36,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:36,297 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:21:36,298 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:21:36,298 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-14 02:21:36,381 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 13 states and 18 transitions. Complement of second has 5 states. [2019-01-14 02:21:36,384 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:21:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:36,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-14 02:21:36,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:36,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:21:36,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:36,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:21:36,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:36,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2019-01-14 02:21:36,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:36,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2019-01-14 02:21:36,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:21:36,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:21:36,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:21:36,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:21:36,392 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:21:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:21:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-14 02:21:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:21:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-14 02:21:36,394 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:21:36,394 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:21:36,394 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:21:36,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-14 02:21:36,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:21:36,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:36,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:36,399 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-14 02:21:36,399 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:21:36,400 INFO L794 eck$LassoCheckResult]: Stem: 118#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; 119#L9-2 assume !!(main_~x~0 >= 0 && main_~y~0 > 0);main_~y~0 := 1; 120#L11-2 assume !((main_~x~0 > main_~y~0 && main_~y~0 > 0) && main_~y~0 < 1073741824); 123#L11-3 main_~x~0 := main_~x~0 - 1; 121#L9-2 assume !!(main_~x~0 >= 0 && main_~y~0 > 0);main_~y~0 := 1; 122#L11-2 [2019-01-14 02:21:36,400 INFO L796 eck$LassoCheckResult]: Loop: 122#L11-2 assume !!((main_~x~0 > main_~y~0 && main_~y~0 > 0) && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 122#L11-2 [2019-01-14 02:21:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:36,401 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2019-01-14 02:21:36,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:36,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:36,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:21:36,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:36,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:21:36,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 925896921, now seen corresponding path program 1 times [2019-01-14 02:21:36,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:36,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:21:36,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:36,589 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:21:36,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:21:36,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:21:36,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:36,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:36,768 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:21:36,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:21:36,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-01-14 02:21:36,829 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:36,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:36,829 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:36,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:36,830 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:21:36,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:36,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:36,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:36,830 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:21:36,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:36,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:36,832 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:21:36,838 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:21:36,853 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:21:36,951 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:36,951 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:36,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:36,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:36,975 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:21:36,976 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:36,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:21:36,982 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:37,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:21:37,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:21:37,028 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:21:37,030 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:21:37,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:21:37,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:21:37,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:21:37,031 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:21:37,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:37,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:21:37,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:21:37,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:21:37,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:21:37,032 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:21:37,033 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:21:37,043 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:21:37,075 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:21:37,157 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:21:37,158 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:21:37,158 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:21:37,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:37,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:37,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:37,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:37,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:21:37,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:21:37,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:21:37,177 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:21:37,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:21:37,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:21:37,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:21:37,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:21:37,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:21:37,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:21:37,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:21:37,188 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:21:37,200 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:21:37,202 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:21:37,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:21:37,202 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:21:37,203 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:21:37,203 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 2147483647 Supporting invariants [] [2019-01-14 02:21:37,203 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:21:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:37,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:37,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:37,262 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:21:37,263 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:21:37,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:37,279 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:21:37,280 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:21:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:37,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:37,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:37,281 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:21:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:37,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:37,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:37,328 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:21:37,329 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:21:37,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:37,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:21:37,355 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:21:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:21:37,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:37,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:37,357 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:21:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:37,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:37,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:37,408 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:21:37,409 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:21:37,409 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:21:37,424 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 4 states. [2019-01-14 02:21:37,426 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:21:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:21:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:21:37,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:21:37,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:21:37,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:21:37,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:21:37,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 02:21:37,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:37,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 02:21:37,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:21:37,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:21:37,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:21:37,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:37,432 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:37,432 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:37,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:21:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:21:37,438 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 10 states. [2019-01-14 02:21:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:21:37,441 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:21:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:21:37,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:21:37,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:37,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:21:37,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:21:37,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:21:37,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:21:37,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:37,442 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:37,442 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:37,442 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:21:37,442 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:21:37,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:21:37,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:21:37,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:21:37,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:21:37 BoogieIcfgContainer [2019-01-14 02:21:37,450 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:21:37,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:21:37,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:21:37,451 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:21:37,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:33" (3/4) ... [2019-01-14 02:21:37,455 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:21:37,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:21:37,457 INFO L168 Benchmark]: Toolchain (without parser) took 4703.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.3 MB in the beginning and 893.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 190.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:37,459 INFO L168 Benchmark]: CDTParser took 0.22 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:21:37,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:37,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.59 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:21:37,461 INFO L168 Benchmark]: Boogie Preprocessor took 19.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:21:37,462 INFO L168 Benchmark]: RCFGBuilder took 314.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:37,464 INFO L168 Benchmark]: BuchiAutomizer took 4062.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.9 MB in the end (delta: 212.1 MB). Peak memory consumption was 212.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:37,466 INFO L168 Benchmark]: Witness Printer took 5.21 ms. Allocated memory is still 1.2 GB. Free memory was 899.9 MB in the beginning and 893.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:21:37,473 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.22 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 258.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.59 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 314.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4062.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.9 MB in the end (delta: 212.1 MB). Peak memory consumption was 212.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.21 ms. Allocated memory is still 1.2 GB. Free memory was 899.9 MB in the beginning and 893.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. 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 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * y + 2147483647 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * y + 2147483647 and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 25 SDslu, 9 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax169 hnf98 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq142 hnf94 smp100 dnf100 smp100 tf108 neg100 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...