./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2_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 ff3652fa62b489d4e6a4a85c8349c06d13bd2232 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:34:42,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:34:42,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:34:42,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:34:42,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:34:42,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:34:42,842 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:34:42,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:34:42,848 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:34:42,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:34:42,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:34:42,857 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:34:42,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:34:42,864 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:34:42,867 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:34:42,868 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:34:42,869 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:34:42,871 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:34:42,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:34:42,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:34:42,880 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:34:42,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:34:42,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:34:42,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:34:42,891 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:34:42,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:34:42,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:34:42,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:34:42,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:34:42,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:34:42,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:34:42,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:34:42,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:34:42,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:34:42,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:34:42,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:34:42,905 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:34:42,928 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:34:42,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:34:42,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:34:42,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:34:42,931 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:34:42,931 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:34:42,932 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:34:42,932 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:34:42,932 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:34:42,932 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:34:42,933 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:34:42,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:34:42,934 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:34:42,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:34:42,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:34:42,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:34:42,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:34:42,936 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:34:42,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:34:42,936 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:34:42,936 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:34:42,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:34:42,937 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:34:42,937 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:34:42,938 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:34:42,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:34:42,938 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:34:42,938 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:34:42,939 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:34:42,940 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 -> ff3652fa62b489d4e6a4a85c8349c06d13bd2232 [2019-01-01 21:34:43,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:34:43,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:34:43,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:34:43,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:34:43,037 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:34:43,038 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c [2019-01-01 21:34:43,113 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1efd1da/558d40ea494140f8a2659c86fdc9656b/FLAG2e5f773ea [2019-01-01 21:34:43,600 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:34:43,601 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c [2019-01-01 21:34:43,610 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1efd1da/558d40ea494140f8a2659c86fdc9656b/FLAG2e5f773ea [2019-01-01 21:34:43,912 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1efd1da/558d40ea494140f8a2659c86fdc9656b [2019-01-01 21:34:43,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:34:43,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:34:43,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:43,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:34:43,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:34:43,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:43" (1/1) ... [2019-01-01 21:34:43,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c046ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:43, skipping insertion in model container [2019-01-01 21:34:43,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:43" (1/1) ... [2019-01-01 21:34:43,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:34:43,956 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:34:44,201 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:44,208 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:34:44,233 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:44,254 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:34:44,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44 WrapperNode [2019-01-01 21:34:44,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:44,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:44,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:34:44,256 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:34:44,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:44,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:34:44,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:34:44,302 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:34:44,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:34:44,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:34:44,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:34:44,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:34:44,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34: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-01 21:34:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:34:44,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:34:44,634 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:34:44,634 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:34:44,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:44 BoogieIcfgContainer [2019-01-01 21:34:44,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:34:44,636 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:34:44,636 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:34:44,641 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:34:44,641 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:44,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:34:43" (1/3) ... [2019-01-01 21:34:44,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53044514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:44, skipping insertion in model container [2019-01-01 21:34:44,643 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:44,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (2/3) ... [2019-01-01 21:34:44,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53044514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:44, skipping insertion in model container [2019-01-01 21:34:44,644 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:44,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:44" (3/3) ... [2019-01-01 21:34:44,646 INFO L375 chiAutomizerObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c [2019-01-01 21:34:44,713 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:34:44,714 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:34:44,714 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:34:44,714 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:34:44,714 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:34:44,715 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:34:44,715 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:34:44,715 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:34:44,715 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:34:44,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:34:44,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:34:44,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:44,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:44,766 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:44,766 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:44,767 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:34:44,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:34:44,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:34:44,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:44,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:44,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:44,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:44,781 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#L17-2true [2019-01-01 21:34:44,782 INFO L796 eck$LassoCheckResult]: Loop: 3#L17-2true assume !!(main_~x~0 >= 0);main_~y~0 := 1; 6#L19-2true assume !(main_~y~0 < main_~x~0); 5#L19-3true main_~x~0 := main_~x~0 - 1; 3#L17-2true [2019-01-01 21:34:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:34:44,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:44,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:44,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:44,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:44,912 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-01 21:34:44,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:44,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:44,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-01 21:34:44,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:44,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,098 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 21:34:45,177 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:45,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:45,179 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:45,179 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:45,179 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:45,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:45,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:45,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:45,180 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:34:45,180 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:45,180 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:45,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:45,530 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:45,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:45,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:45,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:45,564 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:45,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:45,570 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:45,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:45,592 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-01 21:34:45,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:45,597 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-01 21:34:45,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:45,624 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:45,656 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:45,658 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:45,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:45,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:45,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:45,658 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:45,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:45,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:45,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:45,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:34:45,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:45,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:45,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:46,033 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:46,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:46,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:46,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:46,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:46,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:46,062 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:46,062 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:34:46,065 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:46,065 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:46,066 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:46,066 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-01 21:34:46,068 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:46,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:46,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:46,389 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:46,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-01 21:34:46,531 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-01 21:34:46,532 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-01 21:34:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-01 21:34:46,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:34:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:46,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:34:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:34:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:46,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. [2019-01-01 21:34:46,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:34:46,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-01 21:34:46,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:34:46,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:34:46,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-01 21:34:46,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:46,551 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:34:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-01 21:34:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-01 21:34:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:34:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-01 21:34:46,583 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-01 21:34:46,583 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-01 21:34:46,583 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:34:46,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2019-01-01 21:34:46,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:34:46,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:46,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:46,585 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:34:46,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:34:46,585 INFO L794 eck$LassoCheckResult]: Stem: 74#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; 70#L17-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 72#L19-2 [2019-01-01 21:34:46,586 INFO L796 eck$LassoCheckResult]: Loop: 72#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 72#L19-2 [2019-01-01 21:34:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:34:46,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:46,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:46,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:46,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:46,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-01 21:34:46,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:46,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:46,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-01 21:34:46,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:46,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:46,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:46,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:46,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:46,750 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:46,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:46,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:46,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:46,751 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:46,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:46,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:46,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:34:46,751 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:46,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:46,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,842 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:46,842 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,867 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,872 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:46,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:47,022 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:47,024 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:47,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:47,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:47,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:47,025 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:47,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:47,025 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:47,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:34:47,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:47,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:47,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-01 21:34:47,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34: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-01 21:34:47,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:47,297 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:47,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:47,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:47,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:47,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:47,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:47,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:47,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:47,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:47,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:47,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:47,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:47,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:47,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:47,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:47,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:47,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:47,345 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:47,364 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:34:47,368 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:47,369 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:47,369 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:47,370 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:47,370 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:47,370 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:47,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:47,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:47,704 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:34:47,705 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-01 21:34:47,770 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-01 21:34:47,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:34:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:34:47,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-01 21:34:47,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 21:34:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:34:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2019-01-01 21:34:47,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:34:47,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2019-01-01 21:34:47,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:34:47,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:34:47,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-01 21:34:47,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:47,776 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-01 21:34:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-01 21:34:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-01 21:34:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:34:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-01 21:34:47,778 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:34:47,778 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:34:47,779 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:34:47,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-01 21:34:47,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:34:47,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:47,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:47,780 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-01 21:34:47,780 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:34:47,780 INFO L794 eck$LassoCheckResult]: Stem: 122#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; 118#L17-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 119#L19-2 assume !(main_~y~0 < main_~x~0); 123#L19-3 main_~x~0 := main_~x~0 - 1; 120#L17-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 121#L19-2 [2019-01-01 21:34:47,780 INFO L796 eck$LassoCheckResult]: Loop: 121#L19-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 121#L19-2 [2019-01-01 21:34:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2019-01-01 21:34:47,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:47,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-01 21:34:47,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:47,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash 925896921, now seen corresponding path program 1 times [2019-01-01 21:34:47,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:47,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:47,915 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-01 21:34:47,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:47,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:48,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:48,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 21:34:48,109 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:48,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:48,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:48,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:48,110 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:48,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:48,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:48,111 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:34:48,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:48,112 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:48,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,246 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:48,247 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,254 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,277 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,278 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-01 21:34:48,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,284 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,310 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,336 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:48,336 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,468 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:48,470 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:48,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:48,470 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:48,470 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:48,470 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:48,470 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:48,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:48,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:34:48,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:48,471 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:48,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,592 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:48,592 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:48,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:48,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:48,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:48,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:48,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:48,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:48,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:48,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:48,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:48,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:48,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:48,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:48,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:48,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:48,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:48,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:48,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:48,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:48,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:48,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:48,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:48,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:48,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:48,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:48,631 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:48,642 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:34:48,642 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:48,642 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:48,643 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:48,643 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:48,643 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:48,643 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:48,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:48,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:48,684 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:34:48,684 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:34:48,719 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-01 21:34:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:34:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:34:48,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-01 21:34:48,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,721 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:48,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:48,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:48,781 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-01 21:34:48,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:34:48,793 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-01 21:34:48,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:34:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:34:48,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-01 21:34:48,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,795 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:48,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:48,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:48,908 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-01 21:34:48,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:34:48,925 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-01 21:34:48,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:34:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:34:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-01 21:34:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-01 21:34:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:34:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-01 21:34:48,930 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:48,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-01 21:34:48,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:34:48,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:34:48,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:34:48,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:48,931 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:48,933 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:48,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:34:48,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:34:48,940 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 7 states. [2019-01-01 21:34:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:48,944 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 21:34:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:34:48,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 21:34:48,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:48,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:34:48,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:34:48,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:34:48,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:34:48,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:48,945 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:48,945 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:48,945 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:48,945 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:34:48,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:34:48,946 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:48,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:34:48,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:34:48 BoogieIcfgContainer [2019-01-01 21:34:48,953 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:34:48,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:34:48,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:34:48,954 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:34:48,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:44" (3/4) ... [2019-01-01 21:34:48,959 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:34:48,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:34:48,960 INFO L168 Benchmark]: Toolchain (without parser) took 5044.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 951.4 MB in the beginning and 868.8 MB in the end (delta: 82.5 MB). Peak memory consumption was 187.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:48,962 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:48,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.27 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:48,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.80 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-01 21:34:48,965 INFO L168 Benchmark]: Boogie Preprocessor took 24.06 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-01 21:34:48,966 INFO L168 Benchmark]: RCFGBuilder took 309.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:48,968 INFO L168 Benchmark]: BuchiAutomizer took 4316.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 868.8 MB in the end (delta: 210.4 MB). Peak memory consumption was 210.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:48,968 INFO L168 Benchmark]: Witness Printer took 6.12 ms. Allocated memory is still 1.1 GB. Free memory is still 868.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:48,974 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.17 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 336.27 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.80 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 24.06 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 309.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4316.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 868.8 MB in the end (delta: 210.4 MB). Peak memory consumption was 210.4 MB. Max. memory is 11.5 GB. * Witness Printer took 6.12 ms. Allocated memory is still 1.1 GB. Free memory is still 868.8 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 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 -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. 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: 15 SDtfs, 21 SDslu, 6 SDs, 0 SdLazy, 39 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...