./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/PastaC3_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/PastaC3_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 d74da2e3412ebf25201dbb4db5374c4c67ab19bd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:37:37,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:37:37,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:37:37,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:37:37,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:37:37,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:37:37,990 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:37:37,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:37:37,994 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:37:37,995 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:37:37,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:37:37,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:37:37,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:37:37,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:37:38,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:37:38,002 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:37:38,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:37:38,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:37:38,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:37:38,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:37:38,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:37:38,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:37:38,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:37:38,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:37:38,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:37:38,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:37:38,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:37:38,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:37:38,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:37:38,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:37:38,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:37:38,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:37:38,048 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:37:38,048 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:37:38,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:37:38,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:37:38,055 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:37:38,079 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:37:38,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:37:38,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:37:38,081 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:37:38,081 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:37:38,082 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:37:38,082 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:37:38,082 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:37:38,082 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:37:38,082 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:37:38,083 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:37:38,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:37:38,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:37:38,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:37:38,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:37:38,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:37:38,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:37:38,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:37:38,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:37:38,086 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:37:38,086 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:37:38,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:37:38,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:37:38,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:37:38,087 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:37:38,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:37:38,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:37:38,088 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:37:38,089 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:37:38,089 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 -> d74da2e3412ebf25201dbb4db5374c4c67ab19bd [2019-01-01 21:37:38,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:37:38,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:37:38,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:37:38,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:37:38,153 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:37:38,154 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/PastaC3_true-termination_true-no-overflow.c [2019-01-01 21:37:38,221 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dcd9c61b/91b356aba4bb4b54a7fd1bdce780fbbc/FLAG92f7c4df5 [2019-01-01 21:37:38,702 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:37:38,703 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/PastaC3_true-termination_true-no-overflow.c [2019-01-01 21:37:38,710 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dcd9c61b/91b356aba4bb4b54a7fd1bdce780fbbc/FLAG92f7c4df5 [2019-01-01 21:37:39,063 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dcd9c61b/91b356aba4bb4b54a7fd1bdce780fbbc [2019-01-01 21:37:39,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:37:39,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:37:39,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:37:39,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:37:39,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:37:39,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf50b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39, skipping insertion in model container [2019-01-01 21:37:39,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:37:39,110 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:37:39,296 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:37:39,301 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:37:39,320 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:37:39,336 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:37:39,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39 WrapperNode [2019-01-01 21:37:39,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:37:39,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:37:39,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:37:39,338 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:37:39,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:37:39,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:37:39,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:37:39,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:37:39,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... [2019-01-01 21:37:39,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:37:39,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:37:39,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:37:39,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:37:39,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:37:39,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:37:39,764 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:37:39,765 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:37:39,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:39 BoogieIcfgContainer [2019-01-01 21:37:39,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:37:39,766 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:37:39,766 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:37:39,771 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:37:39,772 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:39,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:37:39" (1/3) ... [2019-01-01 21:37:39,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66917ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:37:39, skipping insertion in model container [2019-01-01 21:37:39,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:39,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:39" (2/3) ... [2019-01-01 21:37:39,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66917ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:37:39, skipping insertion in model container [2019-01-01 21:37:39,775 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:39,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:39" (3/3) ... [2019-01-01 21:37:39,777 INFO L375 chiAutomizerObserver]: Analyzing ICFG PastaC3_true-termination_true-no-overflow.c [2019-01-01 21:37:39,849 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:37:39,850 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:37:39,850 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:37:39,850 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:37:39,851 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:37:39,851 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:37:39,851 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:37:39,851 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:37:39,851 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:37:39,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:37:39,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:39,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:39,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:39,903 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:37:39,903 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:39,903 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:37:39,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:37:39,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:39,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:39,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:39,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:37:39,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:39,915 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 6#L14-2true [2019-01-01 21:37:39,916 INFO L796 eck$LassoCheckResult]: Loop: 6#L14-2true assume !!(main_~x~0 < main_~y~0); 9#L14true assume main_~x~0 < main_~z~0;main_~x~0 := 1 + main_~x~0; 6#L14-2true [2019-01-01 21:37:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:37:39,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:39,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:39,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:40,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:37:40,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:40,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:40,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:37:40,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:40,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:40,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:40,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:40,219 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 21:37:40,318 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:40,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:40,321 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:40,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:40,322 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:40,322 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:40,322 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:40,322 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:40,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaC3_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:37:40,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:40,323 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:40,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:40,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:40,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:40,745 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:40,746 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:40,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:40,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:40,781 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:40,781 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:40,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:40,788 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:40,814 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:40,814 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:40,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:40,827 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:40,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:40,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:41,041 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:41,045 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:41,045 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:41,045 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:41,045 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:41,045 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:41,046 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:41,046 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:41,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:41,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaC3_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:37:41,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:41,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:41,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:41,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:41,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:41,227 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:41,234 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:41,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:41,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:41,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:41,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:41,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:41,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:41,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:41,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:41,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:41,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:41,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:41,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:41,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:41,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:41,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:41,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:41,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:41,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:41,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:41,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:41,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:41,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:41,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:41,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:41,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:41,298 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:37:41,299 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:41,301 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:41,302 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:41,302 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:41,303 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~y~0) = -1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:37:41,305 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:41,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:41,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:41,661 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:41,662 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:37:41,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 20 states and 28 transitions. Complement of second has 7 states. [2019-01-01 21:37:41,738 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:37:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-01-01 21:37:41,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:37:41,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:41,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:37:41,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:41,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:37:41,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:41,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2019-01-01 21:37:41,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:41,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 8 states and 11 transitions. [2019-01-01 21:37:41,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:41,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:37:41,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-01 21:37:41,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:41,761 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:37:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-01 21:37:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-01 21:37:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:37:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:37:41,798 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:41,798 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:37:41,798 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:37:41,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:37:41,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:41,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:41,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:41,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:37:41,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:41,800 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 64#L14-2 assume !!(main_~x~0 < main_~y~0); 66#L14 [2019-01-01 21:37:41,800 INFO L796 eck$LassoCheckResult]: Loop: 66#L14 assume !(main_~x~0 < main_~z~0);main_~z~0 := 1 + main_~z~0; 65#L14-2 assume !!(main_~x~0 < main_~y~0); 66#L14 [2019-01-01 21:37:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:41,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:37:41,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:41,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:41,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:41,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:41,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2019-01-01 21:37:41,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:41,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:41,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:41,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:41,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 1 times [2019-01-01 21:37:41,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:41,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:41,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:41,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:41,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:41,985 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:41,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:41,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:41,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:41,986 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:41,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:41,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:41,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:41,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaC3_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:37:41,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:41,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:41,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:41,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:41,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-01 21:37:42,103 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:42,104 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) [2019-01-01 21:37:42,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:42,114 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:42,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:42,146 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:37:42,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:42,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:42,177 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:42,178 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:42,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:42,190 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:42,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:42,216 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:42,446 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:42,449 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:42,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:42,450 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:42,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:42,450 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:42,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:42,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:42,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:42,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaC3_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:37:42,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:42,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:42,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:42,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:42,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:42,648 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:37:42,649 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:42,649 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:42,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:42,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:42,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:42,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:42,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:42,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:42,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:42,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:42,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:42,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:42,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:42,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:42,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:42,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:42,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:42,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:42,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:42,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:42,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:42,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:42,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:42,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:42,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:42,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:42,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:42,732 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:42,735 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:37:42,735 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:42,736 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:42,736 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:42,736 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~z~0) = 2*ULTIMATE.start_main_~x~0 - 2*ULTIMATE.start_main_~z~0 + 1 Supporting invariants [] [2019-01-01 21:37:42,737 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:42,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:42,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:42,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:42,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:42,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:37:42,956 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 15 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:37:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:37:42,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:37:42,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:42,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:42,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:42,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:37:42,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:42,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2019-01-01 21:37:42,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:42,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2019-01-01 21:37:42,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:42,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:37:42,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-01-01 21:37:42,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:42,963 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:37:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-01-01 21:37:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:37:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:37:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-01 21:37:42,966 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:37:42,966 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:37:42,966 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:37:42,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-01 21:37:42,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:42,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:42,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:42,968 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-01 21:37:42,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:42,968 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 119#L14-2 assume !!(main_~x~0 < main_~y~0); 120#L14 assume main_~x~0 < main_~z~0;main_~x~0 := 1 + main_~x~0; 127#L14-2 assume !!(main_~x~0 < main_~y~0); 123#L14 [2019-01-01 21:37:42,968 INFO L796 eck$LassoCheckResult]: Loop: 123#L14 assume !(main_~x~0 < main_~z~0);main_~z~0 := 1 + main_~z~0; 124#L14-2 assume !!(main_~x~0 < main_~y~0); 123#L14 [2019-01-01 21:37:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:42,969 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-01 21:37:42,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:42,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:42,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:42,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-01 21:37:42,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:42,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:42,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:42,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:42,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:42,997 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 1 times [2019-01-01 21:37:42,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:42,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:42,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:37:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:43,060 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:43,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:43,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:43,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:43,061 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:43,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:43,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:43,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:43,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaC3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:37:43,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:43,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:43,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:43,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:43,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:43,355 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:37:43,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:43,645 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:43,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:43,649 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:43,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:43,677 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:43,919 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:43,922 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:43,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:43,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:43,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:43,923 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:43,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:43,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:43,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:43,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaC3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:37:43,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:43,924 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:43,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:43,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:43,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:44,041 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:44,041 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:44,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:44,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:44,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:44,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:44,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:44,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:44,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:44,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:44,053 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:44,058 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:44,058 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:37:44,058 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:44,059 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:44,059 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:44,059 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~z~0) = 2*ULTIMATE.start_main_~x~0 - 2*ULTIMATE.start_main_~z~0 + 1 Supporting invariants [] [2019-01-01 21:37:44,059 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:44,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:44,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:44,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:44,214 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:44,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:37:44,253 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-01-01 21:37:44,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:37:44,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:44,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:44,255 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:44,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:44,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:44,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:44,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:44,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:37:44,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 12 states and 17 transitions. Complement of second has 5 states. [2019-01-01 21:37:44,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:37:44,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:44,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:44,386 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:44,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:44,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:44,454 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:44,454 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:37:44,473 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 4 states. [2019-01-01 21:37:44,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:37:44,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:44,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:44,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:37:44,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:44,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:37:44,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:44,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-01 21:37:44,480 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:44,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2019-01-01 21:37:44,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:37:44,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:37:44,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:37:44,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:37:44,481 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:44,481 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:44,481 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:44,481 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:37:44,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:37:44,482 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:44,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:37:44,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:37:44 BoogieIcfgContainer [2019-01-01 21:37:44,492 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:37:44,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:37:44,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:37:44,493 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:37:44,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:39" (3/4) ... [2019-01-01 21:37:44,498 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:37:44,498 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:37:44,499 INFO L168 Benchmark]: Toolchain (without parser) took 5431.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.5 MB). Free memory was 951.3 MB in the beginning and 830.1 MB in the end (delta: 121.3 MB). Peak memory consumption was 186.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:44,501 INFO L168 Benchmark]: CDTParser took 0.19 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:37:44,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.44 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-01 21:37:44,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.25 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:37:44,503 INFO L168 Benchmark]: Boogie Preprocessor took 27.27 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:37:44,504 INFO L168 Benchmark]: RCFGBuilder took 359.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.5 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -99.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:44,505 INFO L168 Benchmark]: BuchiAutomizer took 4725.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 830.1 MB in the end (delta: 209.9 MB). Peak memory consumption was 209.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:44,506 INFO L168 Benchmark]: Witness Printer took 5.97 ms. Allocated memory is still 1.1 GB. Free memory is still 830.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:44,510 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.44 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 40.25 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 27.27 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 359.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.5 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -99.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4725.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 830.1 MB in the end (delta: 209.9 MB). Peak memory consumption was 209.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.97 ms. Allocated memory is still 1.1 GB. Free memory is still 830.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * x + y and consists of 5 locations. One deterministic module has affine ranking function 2 * x + -2 * z + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * x + -2 * z + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 18 SDslu, 6 SDs, 0 SdLazy, 33 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax187 hnf97 lsp51 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...