./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/loop-invgen/nested6_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 934ee9c856a834ce808d29dea79c6912619f897f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:07:48,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:07:48,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:07:48,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:07:48,932 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:07:48,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:07:48,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:07:48,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:07:48,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:07:48,947 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:07:48,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:07:48,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:07:48,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:07:48,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:07:48,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:07:48,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:07:48,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:07:48,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:07:48,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:07:48,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:07:48,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:07:48,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:07:48,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:07:48,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:07:48,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:07:48,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:07:48,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:07:48,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:07:48,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:07:48,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:07:48,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:07:48,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:07:48,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:07:48,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:07:48,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:07:48,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:07:48,976 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:07:48,996 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:07:48,996 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:07:48,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:07:48,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:07:48,998 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:07:48,998 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:07:48,998 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:07:48,999 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:07:49,000 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:07:49,000 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:07:49,000 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:07:49,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:07:49,000 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:07:49,001 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:07:49,001 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:07:49,002 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:07:49,002 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:07:49,002 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:07:49,002 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:07:49,002 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:07:49,003 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:07:49,004 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:07:49,004 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:07:49,004 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:07:49,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:07:49,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:07:49,005 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:07:49,005 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:07:49,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:07:49,005 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:07:49,005 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:07:49,007 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:07:49,008 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 934ee9c856a834ce808d29dea79c6912619f897f [2019-01-01 23:07:49,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:07:49,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:07:49,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:07:49,079 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:07:49,079 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:07:49,080 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2019-01-01 23:07:49,145 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8237903de/cf5f91fe92b742a6803e1e714c38e432/FLAG5540da9bc [2019-01-01 23:07:49,643 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:07:49,644 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2019-01-01 23:07:49,652 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8237903de/cf5f91fe92b742a6803e1e714c38e432/FLAG5540da9bc [2019-01-01 23:07:49,967 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8237903de/cf5f91fe92b742a6803e1e714c38e432 [2019-01-01 23:07:49,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:07:49,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:07:49,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:07:49,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:07:49,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:07:49,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:07:49" (1/1) ... [2019-01-01 23:07:49,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38446809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:49, skipping insertion in model container [2019-01-01 23:07:49,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:07:49" (1/1) ... [2019-01-01 23:07:49,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:07:50,020 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:07:50,256 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:07:50,262 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:07:50,290 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:07:50,309 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:07:50,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50 WrapperNode [2019-01-01 23:07:50,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:07:50,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:07:50,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:07:50,311 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:07:50,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:07:50,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:07:50,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:07:50,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:07:50,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (1/1) ... [2019-01-01 23:07:50,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:07:50,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:07:50,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:07:50,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:07:50,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (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 23:07:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:07:50,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:07:50,943 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:07:50,943 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-01 23:07:50,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:07:50 BoogieIcfgContainer [2019-01-01 23:07:50,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:07:50,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:07:50,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:07:50,948 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:07:50,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:07:50,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:07:49" (1/3) ... [2019-01-01 23:07:50,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cbf78f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:07:50, skipping insertion in model container [2019-01-01 23:07:50,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:07:50,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:07:50" (2/3) ... [2019-01-01 23:07:50,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cbf78f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:07:50, skipping insertion in model container [2019-01-01 23:07:50,952 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:07:50,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:07:50" (3/3) ... [2019-01-01 23:07:50,955 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2019-01-01 23:07:51,023 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:07:51,024 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:07:51,024 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:07:51,024 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:07:51,025 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:07:51,025 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:07:51,025 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:07:51,026 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:07:51,026 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:07:51,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-01-01 23:07:51,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:07:51,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:51,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:51,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:07:51,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:07:51,085 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:07:51,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-01-01 23:07:51,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:07:51,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:51,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:51,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:07:51,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:07:51,096 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 21#L14true assume !!(main_~n~0 < 1000000); 3#L15true assume main_~k~0 == main_~n~0; 22#L15-1true main_~i~0 := 0; 5#L19-3true [2019-01-01 23:07:51,096 INFO L796 eck$LassoCheckResult]: Loop: 5#L19-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 8#L20-2true assume !(main_~j~0 < main_~n~0); 6#L19-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 5#L19-3true [2019-01-01 23:07:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:51,104 INFO L82 PathProgramCache]: Analyzing trace with hash 959370, now seen corresponding path program 1 times [2019-01-01 23:07:51,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:51,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:51,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash 50890, now seen corresponding path program 1 times [2019-01-01 23:07:51,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:51,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:51,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:51,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158303, now seen corresponding path program 1 times [2019-01-01 23:07:51,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:51,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:51,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:51,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:51,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:51,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:07:51,435 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:51,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:51,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:51,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:51,437 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:51,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:51,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:51,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:51,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration1_Loop [2019-01-01 23:07:51,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:51,438 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:51,462 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 23:07:51,490 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 23:07:51,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:51,694 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 23:07:51,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:51,703 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 23:07:51,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:51,731 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:51,947 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:51,949 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:51,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:51,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:51,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:51,950 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:51,950 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:51,950 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:51,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:51,950 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration1_Loop [2019-01-01 23:07:51,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:51,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:51,952 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 23:07:52,056 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 23:07:52,261 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:52,267 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:52,269 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 23:07:52,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:52,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:52,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:52,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:52,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:52,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:52,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:52,288 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:52,304 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:07:52,304 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:52,307 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:52,307 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:52,308 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:52,309 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 23:07:52,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:52,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:52,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:52,432 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 23:07:52,449 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 23:07:52,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-01-01 23:07:52,569 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 63 states and 90 transitions. Complement of second has 7 states. [2019-01-01 23:07:52,570 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 23:07:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2019-01-01 23:07:52,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 23:07:52,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:52,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 23:07:52,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:52,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 23:07:52,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:52,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 90 transitions. [2019-01-01 23:07:52,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:07:52,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 26 states and 33 transitions. [2019-01-01 23:07:52,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 23:07:52,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 23:07:52,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-01-01 23:07:52,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:52,596 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-01 23:07:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-01-01 23:07:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-01 23:07:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 23:07:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-01-01 23:07:52,632 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-01 23:07:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:07:52,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:07:52,638 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2019-01-01 23:07:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:52,856 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-01-01 23:07:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:07:52,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-01-01 23:07:52,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-01 23:07:52,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-01-01 23:07:52,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 23:07:52,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 23:07:52,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-01-01 23:07:52,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:52,864 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-01 23:07:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-01-01 23:07:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2019-01-01 23:07:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 23:07:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-01 23:07:52,869 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-01 23:07:52,869 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-01 23:07:52,869 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:07:52,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-01-01 23:07:52,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:07:52,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:52,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:52,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 23:07:52,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:07:52,872 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 231#L14 assume !!(main_~n~0 < 1000000); 208#L15 assume main_~k~0 == main_~n~0; 209#L15-1 main_~i~0 := 0; 210#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 212#L20-2 [2019-01-01 23:07:52,873 INFO L796 eck$LassoCheckResult]: Loop: 212#L20-2 assume !!(main_~j~0 < main_~n~0); 218#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 222#L22-2 assume !(main_~k~0 < main_~n~0); 216#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 212#L20-2 [2019-01-01 23:07:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 1 times [2019-01-01 23:07:52,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:52,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:52,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1819467, now seen corresponding path program 1 times [2019-01-01 23:07:52,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:52,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:52,925 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 23:07:52,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:07:52,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:07:52,926 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:07:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:07:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:07:52,927 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 23:07:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:53,038 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-01-01 23:07:53,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 23:07:53,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-01 23:07:53,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:07:53,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-01-01 23:07:53,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 23:07:53,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 23:07:53,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-01-01 23:07:53,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:53,044 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-01 23:07:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-01-01 23:07:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 23:07:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 23:07:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-01 23:07:53,049 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-01 23:07:53,049 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-01 23:07:53,049 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:07:53,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-01-01 23:07:53,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:07:53,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:53,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:53,052 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 23:07:53,052 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:07:53,052 INFO L794 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 294#L14 assume !!(main_~n~0 < 1000000); 271#L15 assume main_~k~0 == main_~n~0; 272#L15-1 main_~i~0 := 0; 273#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 275#L20-2 [2019-01-01 23:07:53,054 INFO L796 eck$LassoCheckResult]: Loop: 275#L20-2 assume !!(main_~j~0 < main_~n~0); 281#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 291#L4-3 assume !(0 == __VERIFIER_assert_~cond); 289#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 283#L4-6 assume !(0 == __VERIFIER_assert_~cond); 279#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 275#L20-2 [2019-01-01 23:07:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 2 times [2019-01-01 23:07:53,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:53,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:53,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:53,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:53,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 1 times [2019-01-01 23:07:53,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:53,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:53,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:53,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:53,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:53,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140493, now seen corresponding path program 1 times [2019-01-01 23:07:53,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:53,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:53,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:53,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:53,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:53,468 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-01 23:07:53,479 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:53,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:53,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:53,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:53,480 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:53,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:53,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:53,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:53,481 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-01 23:07:53,481 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:53,481 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:53,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:53,596 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 23:07:53,603 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 23:07:53,606 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 23:07:53,762 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:53,762 INFO L412 LassoAnalysis]: Checking for nontermination... 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 23:07:53,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:53,771 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 23:07:53,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:53,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:54,129 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:54,132 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:54,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:54,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:54,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:54,133 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:54,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:54,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:54,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:54,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-01 23:07:54,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:54,133 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:54,140 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 23:07:54,155 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 23:07:54,164 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 23:07:54,173 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 23:07:54,303 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:54,304 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:54,304 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 23:07:54,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:54,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:54,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:54,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:54,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:54,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:54,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:54,316 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:54,325 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:07:54,326 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:54,327 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:54,327 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:54,327 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:54,327 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 23:07:54,328 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:54,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:54,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:54,433 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 23:07:54,434 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 23:07:54,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 23:07:54,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 71 states and 90 transitions. Complement of second has 7 states. [2019-01-01 23:07:54,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 23:07:54,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 23:07:54,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:54,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-01 23:07:54,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:54,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 12 letters. [2019-01-01 23:07:54,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:54,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2019-01-01 23:07:54,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-01 23:07:54,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 56 states and 71 transitions. [2019-01-01 23:07:54,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 23:07:54,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-01 23:07:54,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 71 transitions. [2019-01-01 23:07:54,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:54,506 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2019-01-01 23:07:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 71 transitions. [2019-01-01 23:07:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-01-01 23:07:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 23:07:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-01-01 23:07:54,512 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-01 23:07:54,512 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-01 23:07:54,512 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:07:54,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2019-01-01 23:07:54,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-01 23:07:54,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:54,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:54,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:54,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:07:54,516 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 451#L14 assume !!(main_~n~0 < 1000000); 427#L15 assume main_~k~0 == main_~n~0; 428#L15-1 main_~i~0 := 0; 429#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 431#L20-2 assume !!(main_~j~0 < main_~n~0); 439#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 443#L22-2 [2019-01-01 23:07:54,516 INFO L796 eck$LassoCheckResult]: Loop: 443#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 444#L4 assume !(0 == __VERIFIER_assert_~cond); 453#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 443#L22-2 [2019-01-01 23:07:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158290, now seen corresponding path program 1 times [2019-01-01 23:07:54,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:54,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:54,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:54,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 1 times [2019-01-01 23:07:54,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:54,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:54,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:54,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:54,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734878, now seen corresponding path program 1 times [2019-01-01 23:07:54,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:54,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:54,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:54,611 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:54,611 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:54,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:54,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:54,612 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:54,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:54,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:54,613 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:54,613 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-01 23:07:54,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:54,613 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:54,615 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 23:07:54,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:54,750 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:54,750 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 23:07:54,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:54,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:54,759 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:07:54,760 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=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 23:07:54,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:54,785 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) [2019-01-01 23:07:54,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:54,850 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:55,186 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:55,189 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:55,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:55,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:55,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:55,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:55,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:55,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:55,190 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:55,190 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-01 23:07:55,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:55,190 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:55,191 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 23:07:55,200 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 23:07:55,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:55,348 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:55,349 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 23:07:55,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:55,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:55,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:55,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:55,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:55,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:55,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:55,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:55,353 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 23:07:55,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:55,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:55,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:55,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:55,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:55,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:55,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:55,362 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:55,370 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:07:55,370 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:55,370 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:55,370 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:55,371 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:55,371 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 23:07:55,371 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:55,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:55,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:55,513 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 23:07:55,513 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 23:07:55,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-01-01 23:07:55,664 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 132 states and 167 transitions. Complement of second has 7 states. [2019-01-01 23:07:55,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 23:07:55,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 23:07:55,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:55,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 23:07:55,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:55,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 23:07:55,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:55,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 167 transitions. [2019-01-01 23:07:55,672 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2019-01-01 23:07:55,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 97 states and 121 transitions. [2019-01-01 23:07:55,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 23:07:55,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-01 23:07:55,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2019-01-01 23:07:55,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:55,675 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 121 transitions. [2019-01-01 23:07:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2019-01-01 23:07:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2019-01-01 23:07:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 23:07:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-01-01 23:07:55,684 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-01-01 23:07:55,685 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-01-01 23:07:55,685 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:07:55,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2019-01-01 23:07:55,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-01-01 23:07:55,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:55,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:55,688 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:55,688 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:07:55,689 INFO L794 eck$LassoCheckResult]: Stem: 682#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 683#L14 assume !!(main_~n~0 < 1000000); 656#L15 assume main_~k~0 == main_~n~0; 657#L15-1 main_~i~0 := 0; 658#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 659#L20-2 assume !!(main_~j~0 < main_~n~0); 703#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 708#L4-3 assume !(0 == __VERIFIER_assert_~cond); 707#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 706#L4-6 assume !(0 == __VERIFIER_assert_~cond); 705#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 699#L20-2 assume !(main_~j~0 < main_~n~0); 701#L19-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 698#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 697#L20-2 [2019-01-01 23:07:55,689 INFO L796 eck$LassoCheckResult]: Loop: 697#L20-2 assume !!(main_~j~0 < main_~n~0); 693#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 694#L4-3 assume !(0 == __VERIFIER_assert_~cond); 704#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 702#L4-6 assume !(0 == __VERIFIER_assert_~cond); 700#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 697#L20-2 [2019-01-01 23:07:55,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1340048366, now seen corresponding path program 1 times [2019-01-01 23:07:55,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:55,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:55,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:55,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:07:55,774 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 23:07:55,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:55,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:55,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:07:55,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-01 23:07:55,936 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:07:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 2 times [2019-01-01 23:07:55,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:55,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:56,117 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:56,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:56,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:56,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:56,118 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:56,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:56,118 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:56,118 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:56,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-01 23:07:56,118 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:56,118 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:56,122 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 23:07:56,167 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 23:07:56,173 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 23:07:56,176 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 23:07:56,534 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:07:56,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:56,536 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:07:56,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:56,543 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:07:56,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:56,592 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:56,985 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:56,988 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:56,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:56,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:56,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:56,989 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:56,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:56,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:56,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:56,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-01 23:07:56,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:56,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:56,992 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 23:07:57,025 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 23:07:57,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:07:57,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 23:07:57,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:57,115 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:57,115 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 23:07:57,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:57,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:57,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:57,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:57,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:57,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:57,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:57,125 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:57,129 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:07:57,129 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:57,130 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:57,130 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:57,130 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:57,130 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 23:07:57,132 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:57,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:57,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:57,217 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 23:07:57,217 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 23:07:57,218 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-01-01 23:07:57,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 155 transitions. Complement of second has 7 states. [2019-01-01 23:07:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 23:07:57,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 23:07:57,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:57,293 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:07:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:57,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:57,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:57,341 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 23:07:57,342 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 23:07:57,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-01-01 23:07:57,421 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 155 transitions. Complement of second has 7 states. [2019-01-01 23:07:57,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 23:07:57,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 23:07:57,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:57,426 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:07:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:57,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:57,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:57,497 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 23:07:57,497 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 23:07:57,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-01-01 23:07:57,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 154 transitions. Complement of second has 6 states. [2019-01-01 23:07:57,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-01-01 23:07:57,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 23:07:57,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:57,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 20 letters. Loop has 6 letters. [2019-01-01 23:07:57,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:57,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 12 letters. [2019-01-01 23:07:57,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:57,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. [2019-01-01 23:07:57,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 23:07:57,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 74 states and 92 transitions. [2019-01-01 23:07:57,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 23:07:57,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 23:07:57,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2019-01-01 23:07:57,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:57,565 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-01-01 23:07:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2019-01-01 23:07:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2019-01-01 23:07:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 23:07:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-01-01 23:07:57,578 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-01-01 23:07:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 23:07:57,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-01 23:07:57,581 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2019-01-01 23:07:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:57,727 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2019-01-01 23:07:57,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:07:57,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 180 transitions. [2019-01-01 23:07:57,733 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 23:07:57,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 143 states and 176 transitions. [2019-01-01 23:07:57,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 23:07:57,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 23:07:57,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 176 transitions. [2019-01-01 23:07:57,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:07:57,737 INFO L705 BuchiCegarLoop]: Abstraction has 143 states and 176 transitions. [2019-01-01 23:07:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 176 transitions. [2019-01-01 23:07:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 60. [2019-01-01 23:07:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 23:07:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2019-01-01 23:07:57,743 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-01-01 23:07:57,744 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-01-01 23:07:57,744 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:07:57,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. [2019-01-01 23:07:57,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 23:07:57,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:07:57,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:07:57,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:07:57,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:07:57,745 INFO L794 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 1579#L14 assume !!(main_~n~0 < 1000000); 1558#L15 assume main_~k~0 == main_~n~0; 1559#L15-1 main_~i~0 := 0; 1560#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1562#L20-2 assume !!(main_~j~0 < main_~n~0); 1569#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 1573#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1574#L4 assume !(0 == __VERIFIER_assert_~cond); 1581#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1582#L22-2 assume !(main_~k~0 < main_~n~0); 1592#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1583#L20-2 assume !!(main_~j~0 < main_~n~0); 1576#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 1571#L22-2 [2019-01-01 23:07:57,745 INFO L796 eck$LassoCheckResult]: Loop: 1571#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1572#L4 assume !(0 == __VERIFIER_assert_~cond); 1580#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1571#L22-2 [2019-01-01 23:07:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:57,748 INFO L82 PathProgramCache]: Analyzing trace with hash 279041640, now seen corresponding path program 1 times [2019-01-01 23:07:57,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:57,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:57,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:57,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:07:57,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:57,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:07:57,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:07:57,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:57,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:07:57,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:07:57,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 23:07:57,884 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:07:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 2 times [2019-01-01 23:07:57,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:07:57,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:07:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:57,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:07:57,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:07:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:07:57,959 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:57,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:57,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:57,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:57,959 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:07:57,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:57,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:57,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:57,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-01 23:07:57,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:57,960 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:57,962 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 23:07:57,965 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 23:07:58,054 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:58,055 INFO L412 LassoAnalysis]: Checking for nontermination... 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 23:07:58,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:58,060 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:58,063 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:07:58,064 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:58,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:07:58,085 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:58,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:07:58,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:07:58,523 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:07:58,526 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:07:58,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:07:58,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:07:58,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:07:58,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:07:58,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:07:58,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:07:58,527 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:07:58,527 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-01 23:07:58,527 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:07:58,527 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:07:58,528 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 23:07:58,534 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 23:07:58,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:07:58,611 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:07:58,611 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 23:07:58,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:58,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:58,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:58,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:58,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:58,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:58,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:58,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:07:58,616 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 23:07:58,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:07:58,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:07:58,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:07:58,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:07:58,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:07:58,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:07:58,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:07:58,623 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:07:58,628 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:07:58,628 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:07:58,630 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:07:58,630 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:07:58,630 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:07:58,630 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 23:07:58,630 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:07:58,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:58,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:58,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:58,684 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 23:07:58,685 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 23:07:58,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-01-01 23:07:58,724 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 115 states and 147 transitions. Complement of second has 7 states. [2019-01-01 23:07:58,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 23:07:58,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 23:07:58,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:58,727 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:07:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:58,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:58,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:58,762 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 23:07:58,763 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 23:07:58,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-01-01 23:07:58,794 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 115 states and 147 transitions. Complement of second has 7 states. [2019-01-01 23:07:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 23:07:58,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 23:07:58,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:58,796 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:07:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:07:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:58,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:07:58,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:07:58,993 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 23:07:58,993 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 23:07:58,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-01-01 23:07:59,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 94 states and 119 transitions. Complement of second has 6 states. [2019-01-01 23:07:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:07:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:07:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-01-01 23:07:59,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 23:07:59,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:59,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-01 23:07:59,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:59,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 23:07:59,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:07:59,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 119 transitions. [2019-01-01 23:07:59,155 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:07:59,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 0 states and 0 transitions. [2019-01-01 23:07:59,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:07:59,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:07:59,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:07:59,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:07:59,155 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:07:59,155 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:07:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:07:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:07:59,156 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-01-01 23:07:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:07:59,156 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:07:59,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:07:59,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:07:59,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:07:59,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:07:59,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:07:59,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:07:59,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:07:59,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:07:59,157 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:07:59,157 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:07:59,157 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:07:59,158 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:07:59,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:07:59,158 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:07:59,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:07:59,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:07:59 BoogieIcfgContainer [2019-01-01 23:07:59,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:07:59,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:07:59,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:07:59,166 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:07:59,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:07:50" (3/4) ... [2019-01-01 23:07:59,171 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:07:59,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:07:59,172 INFO L168 Benchmark]: Toolchain (without parser) took 9200.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -108.4 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:07:59,173 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 23:07:59,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.37 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 23:07:59,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.70 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 23:07:59,175 INFO L168 Benchmark]: Boogie Preprocessor took 40.88 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 23:07:59,175 INFO L168 Benchmark]: RCFGBuilder took 545.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:07:59,176 INFO L168 Benchmark]: BuchiAutomizer took 8221.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 97.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:07:59,177 INFO L168 Benchmark]: Witness Printer took 5.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:07:59,182 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 336.37 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 46.70 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 40.88 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 545.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8221.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 97.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. 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 9 terminating modules (4 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * j + n and consists of 4 locations. One deterministic module has affine ranking function -1 * k + n and consists of 4 locations. One nondeterministic module has affine ranking function n + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * k + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.8s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 173 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 189 SDtfs, 349 SDslu, 123 SDs, 0 SdLazy, 297 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf98 lsp85 ukn100 mio100 lsp100 div100 bol100 ite114 ukn100 eq152 hnf93 smp83 dnf98 smp100 tf107 neg99 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...