./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 871be16186d4378aec884efd2352a47ca4eb57bc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:14:34,702 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:14:34,705 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:14:34,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:14:34,723 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:14:34,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:14:34,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:14:34,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:14:34,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:14:34,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:14:34,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:14:34,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:14:34,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:14:34,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:14:34,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:14:34,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:14:34,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:14:34,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:14:34,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:14:34,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:14:34,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:14:34,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:14:34,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:14:34,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:14:34,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:14:34,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:14:34,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:14:34,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:14:34,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:14:34,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:14:34,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:14:34,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:14:34,783 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:14:34,783 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:14:34,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:14:34,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:14:34,785 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:14:34,812 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:14:34,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:14:34,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:14:34,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:14:34,816 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:14:34,816 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:14:34,816 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:14:34,817 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:14:34,817 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:14:34,818 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:14:34,818 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:14:34,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:14:34,818 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:14:34,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:14:34,818 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:14:34,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:14:34,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:14:34,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:14:34,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:14:34,820 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:14:34,820 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:14:34,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:14:34,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:14:34,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:14:34,821 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:14:34,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:14:34,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:14:34,822 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:14:34,825 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:14:34,825 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 871be16186d4378aec884efd2352a47ca4eb57bc [2019-01-14 02:14:34,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:14:34,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:14:34,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:14:34,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:14:34,922 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:14:34,923 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:34,976 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ccace9a/dda6f1c2b022499a99edc3bd61e611d1/FLAG2c308caa8 [2019-01-14 02:14:35,427 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:14:35,427 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:35,435 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ccace9a/dda6f1c2b022499a99edc3bd61e611d1/FLAG2c308caa8 [2019-01-14 02:14:35,773 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ccace9a/dda6f1c2b022499a99edc3bd61e611d1 [2019-01-14 02:14:35,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:14:35,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:14:35,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:35,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:14:35,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:14:35,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:35,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611e71fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35, skipping insertion in model container [2019-01-14 02:14:35,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:35,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:14:35,815 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:14:35,951 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:35,955 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:14:35,968 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:35,980 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:14:35,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35 WrapperNode [2019-01-14 02:14:35,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:35,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:35,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:14:35,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:14:35,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:35,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:36,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:36,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:14:36,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:14:36,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:14:36,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:36,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:36,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:36,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:36,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:36,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:36,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... [2019-01-14 02:14:36,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:14:36,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:14:36,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:14:36,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:14:36,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:14:36,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:14:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2019-01-14 02:14:36,139 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2019-01-14 02:14:36,319 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:14:36,319 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 02:14:36,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:36 BoogieIcfgContainer [2019-01-14 02:14:36,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:14:36,321 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:14:36,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:14:36,324 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:14:36,325 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:36,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:14:35" (1/3) ... [2019-01-14 02:14:36,326 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7081fc44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:36, skipping insertion in model container [2019-01-14 02:14:36,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:36,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:35" (2/3) ... [2019-01-14 02:14:36,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7081fc44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:36, skipping insertion in model container [2019-01-14 02:14:36,327 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:36,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:36" (3/3) ... [2019-01-14 02:14:36,329 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:36,379 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:14:36,380 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:14:36,380 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:14:36,380 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:14:36,380 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:14:36,380 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:14:36,380 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:14:36,380 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:14:36,381 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:14:36,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:14:36,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:14:36,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:36,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:36,429 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:36,429 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:36,429 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:14:36,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:14:36,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:14:36,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:36,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:36,432 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:36,432 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:36,441 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 4#L16true call main_#t~ret3 := mc91(main_~x~0);< 5#mc91ENTRYtrue [2019-01-14 02:14:36,442 INFO L796 eck$LassoCheckResult]: Loop: 5#mc91ENTRYtrue ~n := #in~n; 9#L10true assume !(~n > 100); 11#L11true call #t~ret0 := mc91(11 + ~n);< 5#mc91ENTRYtrue [2019-01-14 02:14:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1008, now seen corresponding path program 1 times [2019-01-14 02:14:36,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:36,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash 36877, now seen corresponding path program 1 times [2019-01-14 02:14:36,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:36,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:36,556 INFO L82 PathProgramCache]: Analyzing trace with hash 30036414, now seen corresponding path program 1 times [2019-01-14 02:14:36,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:36,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:36,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,825 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:36,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:36,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:36,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:36,827 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:36,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:36,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:36,827 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:36,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-14 02:14:36,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:36,828 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:36,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:36,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:36,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:37,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:37,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:37,230 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:37,230 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:37,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:37,238 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-14 02:14:37,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:37,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:37,331 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:37,333 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:37,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:37,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:37,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:37,334 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:37,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:37,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:37,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:37,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-14 02:14:37,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:37,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:37,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:37,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:37,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:37,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:37,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:37,551 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:37,556 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:37,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:37,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:37,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:37,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:37,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:37,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:37,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:37,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:37,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:37,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:37,583 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:14:37,585 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:37,585 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:37,586 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:37,587 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2019-01-14 02:14:37,589 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:37,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:37,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:37,884 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:14:37,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-14 02:14:38,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 31 states and 38 transitions. Complement of second has 12 states. [2019-01-14 02:14:38,188 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-14 02:14:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:14:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-14 02:14:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:14:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:14:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:14:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:38,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-01-14 02:14:38,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:14:38,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 18 states and 24 transitions. [2019-01-14 02:14:38,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:14:38,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:14:38,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-01-14 02:14:38,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:38,210 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:14:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-01-14 02:14:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-14 02:14:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:14:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-14 02:14:38,238 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:14:38,238 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:14:38,238 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:14:38,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-14 02:14:38,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:14:38,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:38,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:38,241 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:14:38,241 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:14:38,241 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 96#L16 call main_#t~ret3 := mc91(main_~x~0);< 101#mc91ENTRY ~n := #in~n; 105#L10 assume !(~n > 100); 98#L11 call #t~ret0 := mc91(11 + ~n);< 107#mc91ENTRY ~n := #in~n; 103#L10 assume ~n > 100;#res := ~n - 10; 104#mc91FINAL assume true; 102#mc91EXIT >#19#return; 97#L11-1 [2019-01-14 02:14:38,241 INFO L796 eck$LassoCheckResult]: Loop: 97#L11-1 call #t~ret1 := mc91(#t~ret0);< 106#mc91ENTRY ~n := #in~n; 109#L10 assume !(~n > 100); 95#L11 call #t~ret0 := mc91(11 + ~n);< 106#mc91ENTRY ~n := #in~n; 109#L10 assume ~n > 100;#res := ~n - 10; 99#mc91FINAL assume true; 108#mc91EXIT >#19#return; 97#L11-1 [2019-01-14 02:14:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1934452539, now seen corresponding path program 1 times [2019-01-14 02:14:38,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:38,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:38,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:38,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 938335010, now seen corresponding path program 1 times [2019-01-14 02:14:38,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash 418213862, now seen corresponding path program 1 times [2019-01-14 02:14:38,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:38,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,706 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:14:38,719 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:38,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:38,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:38,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:38,720 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:38,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:38,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:38,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:38,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-14 02:14:38,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:38,721 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:38,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:38,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:38,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:38,929 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:38,929 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-14 02:14:38,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:38,934 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:38,938 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:38,938 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:38,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:38,960 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:38,963 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:38,963 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:38,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:38,994 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:39,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:39,029 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:51,084 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:14:51,088 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:51,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:51,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:51,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:51,088 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:51,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:51,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:51,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:51,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-14 02:14:51,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:51,089 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:51,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:51,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:51,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:51,269 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:51,270 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:51,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:51,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:51,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:51,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:51,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:51,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:51,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:51,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:51,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:51,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:51,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:51,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:51,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:51,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:51,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:51,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:51,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:51,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:51,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:51,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:51,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:51,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:51,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:51,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:51,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:51,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:51,296 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:51,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:51,305 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:14:51,305 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:51,306 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:51,306 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:51,306 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2019-01-14 02:14:51,306 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:51,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:51,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:51,540 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-14 02:14:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:51,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:51,818 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-14 02:14:51,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-14 02:14:51,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2019-01-14 02:14:52,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 50 states and 72 transitions. Complement of second has 32 states. [2019-01-14 02:14:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:14:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-14 02:14:52,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2019-01-14 02:14:52,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:52,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2019-01-14 02:14:52,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:52,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2019-01-14 02:14:52,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:52,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. [2019-01-14 02:14:52,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:14:52,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 61 transitions. [2019-01-14 02:14:52,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 02:14:52,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 02:14:52,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 61 transitions. [2019-01-14 02:14:52,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:52,561 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-01-14 02:14:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 61 transitions. [2019-01-14 02:14:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-01-14 02:14:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 02:14:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-01-14 02:14:52,570 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-14 02:14:52,570 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-14 02:14:52,570 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:14:52,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2019-01-14 02:14:52,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:14:52,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:52,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:52,574 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:14:52,574 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:52,574 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 283#L16 call main_#t~ret3 := mc91(main_~x~0);< 289#mc91ENTRY ~n := #in~n; 295#L10 assume !(~n > 100); 284#L11 call #t~ret0 := mc91(11 + ~n);< 297#mc91ENTRY ~n := #in~n; 300#L10 assume ~n > 100;#res := ~n - 10; 306#mc91FINAL assume true; 305#mc91EXIT >#19#return; 277#L11-1 call #t~ret1 := mc91(#t~ret0);< 292#mc91ENTRY ~n := #in~n; 309#L10 assume !(~n > 100); 294#L11 [2019-01-14 02:14:52,574 INFO L796 eck$LassoCheckResult]: Loop: 294#L11 call #t~ret0 := mc91(11 + ~n);< 296#mc91ENTRY ~n := #in~n; 293#L10 assume !(~n > 100); 294#L11 [2019-01-14 02:14:52,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:52,574 INFO L82 PathProgramCache]: Analyzing trace with hash 595607827, now seen corresponding path program 2 times [2019-01-14 02:14:52,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:52,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:52,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:52,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:52,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:52,592 INFO L82 PathProgramCache]: Analyzing trace with hash 47317, now seen corresponding path program 2 times [2019-01-14 02:14:52,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:52,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:52,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891907, now seen corresponding path program 3 times [2019-01-14 02:14:52,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:52,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:52,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:14:52,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:14:52,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:14:52,793 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:52,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:52,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:52,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:52,793 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:52,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:52,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:52,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:52,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-14 02:14:52,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:52,794 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:52,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:52,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:52,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:52,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:52,883 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:52,883 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:52,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:52,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:52,891 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:52,891 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:52,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:52,911 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:52,914 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:52,914 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:52,936 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:52,936 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:52,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:52,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:04,993 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:15:04,996 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:04,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:04,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:04,996 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:04,996 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:04,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:04,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:04,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:04,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-14 02:15:04,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:04,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:04,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:05,119 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:05,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:05,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:05,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:05,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:05,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:05,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:05,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:05,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:05,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:05,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:05,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:05,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:05,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:05,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:05,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:05,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:05,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:05,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:05,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:05,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:05,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:05,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:05,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:05,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:05,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:05,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:05,141 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:05,145 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:15:05,145 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:15:05,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:05,145 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:15:05,145 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:05,145 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_~n) = -2*mc91_~n + 189 Supporting invariants [] [2019-01-14 02:15:05,147 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:15:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:05,306 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:15:05,306 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-01-14 02:15:05,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2019-01-14 02:15:05,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-14 02:15:05,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:15:05,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:05,436 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:05,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:15:05,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-01-14 02:15:05,646 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2019-01-14 02:15:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-14 02:15:05,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:15:05,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:05,651 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:05,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:05,772 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:15:05,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-01-14 02:15:05,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 70 states and 99 transitions. Complement of second has 16 states. [2019-01-14 02:15:05,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-14 02:15:05,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:15:05,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:05,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:15:05,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:05,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 6 letters. [2019-01-14 02:15:05,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:05,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 99 transitions. [2019-01-14 02:15:05,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:15:05,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 73 transitions. [2019-01-14 02:15:05,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 02:15:05,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 02:15:05,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2019-01-14 02:15:05,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:05,886 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2019-01-14 02:15:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2019-01-14 02:15:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-14 02:15:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 02:15:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2019-01-14 02:15:05,892 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2019-01-14 02:15:05,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:15:05,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:15:05,896 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand 8 states. [2019-01-14 02:15:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:06,045 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-01-14 02:15:06,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:15:06,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2019-01-14 02:15:06,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 02:15:06,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 74 transitions. [2019-01-14 02:15:06,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-14 02:15:06,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-14 02:15:06,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 74 transitions. [2019-01-14 02:15:06,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:06,053 INFO L706 BuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2019-01-14 02:15:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 74 transitions. [2019-01-14 02:15:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-14 02:15:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 02:15:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2019-01-14 02:15:06,060 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-01-14 02:15:06,060 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-01-14 02:15:06,060 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:15:06,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2019-01-14 02:15:06,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 02:15:06,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:06,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:06,065 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:15:06,065 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2019-01-14 02:15:06,065 INFO L794 eck$LassoCheckResult]: Stem: 814#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 815#L16 call main_#t~ret3 := mc91(main_~x~0);< 816#mc91ENTRY ~n := #in~n; 842#L10 assume !(~n > 100); 834#L11 call #t~ret0 := mc91(11 + ~n);< 838#mc91ENTRY ~n := #in~n; 840#L10 assume !(~n > 100); 835#L11 call #t~ret0 := mc91(11 + ~n);< 837#mc91ENTRY ~n := #in~n; 841#L10 assume ~n > 100;#res := ~n - 10; 839#mc91FINAL assume true; 836#mc91EXIT >#19#return; 804#L11-1 call #t~ret1 := mc91(#t~ret0);< 821#mc91ENTRY ~n := #in~n; 855#L10 assume ~n > 100;#res := ~n - 10; 853#mc91FINAL assume true; 851#mc91EXIT >#21#return; 811#L11-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 848#mc91FINAL assume true; 847#mc91EXIT >#19#return; 809#L11-1 call #t~ret1 := mc91(#t~ret0);< 846#mc91ENTRY [2019-01-14 02:15:06,066 INFO L796 eck$LassoCheckResult]: Loop: 846#mc91ENTRY ~n := #in~n; 843#L10 assume !(~n > 100); 818#L11 call #t~ret0 := mc91(11 + ~n);< 827#mc91ENTRY ~n := #in~n; 824#L10 assume !(~n > 100); 817#L11 call #t~ret0 := mc91(11 + ~n);< 828#mc91ENTRY ~n := #in~n; 822#L10 assume ~n > 100;#res := ~n - 10; 823#mc91FINAL assume true; 857#mc91EXIT >#19#return; 805#L11-1 call #t~ret1 := mc91(#t~ret0);< 819#mc91ENTRY ~n := #in~n; 844#L10 assume ~n > 100;#res := ~n - 10; 845#mc91FINAL assume true; 849#mc91EXIT >#21#return; 811#L11-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 848#mc91FINAL assume true; 847#mc91EXIT >#19#return; 810#L11-1 call #t~ret1 := mc91(#t~ret0);< 846#mc91ENTRY [2019-01-14 02:15:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash -104606680, now seen corresponding path program 1 times [2019-01-14 02:15:06,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:06,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,086 INFO L82 PathProgramCache]: Analyzing trace with hash -735472521, now seen corresponding path program 1 times [2019-01-14 02:15:06,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,102 INFO L82 PathProgramCache]: Analyzing trace with hash -726341392, now seen corresponding path program 2 times [2019-01-14 02:15:06,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:06,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-14 02:15:06,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:15:06,211 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-14 02:15:06,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:15:06,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:15:06,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:15:06,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-14 02:15:06,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:15:06,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 02:15:06,682 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:06,683 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:06,683 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:06,683 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:06,683 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:06,683 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:06,684 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:06,684 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:06,684 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-14 02:15:06,684 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:06,684 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:06,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:06,761 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-14 02:15:06,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:06,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:06,768 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:06,768 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=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-14 02:15:06,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:06,791 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:06,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:06,794 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-14 02:15:06,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:06,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:06,816 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:06,816 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:06,839 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:06,839 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:06,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:06,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:06,901 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:15:06,903 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:06,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:06,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:06,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:06,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:06,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:06,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:06,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:06,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-14 02:15:06,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:06,904 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:06,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,990 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:06,990 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:06,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:06,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:06,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:06,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:06,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:06,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:06,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:06,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:06,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:06,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:06,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:06,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:06,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:06,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:06,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:06,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:06,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:06,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:06,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:06,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:06,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:06,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:06,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:06,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:06,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:06,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:06,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:07,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:07,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:07,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:07,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:07,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:07,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:07,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:07,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:07,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:07,007 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:15:07,007 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:15:07,008 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:07,008 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:15:07,008 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:07,008 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 Supporting invariants [] [2019-01-14 02:15:07,009 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:15:07,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:07,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:07,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 02:15:07,725 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2019-01-14 02:15:07,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-01-14 02:15:08,261 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2019-01-14 02:15:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:15:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2019-01-14 02:15:08,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2019-01-14 02:15:08,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:08,265 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:08,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:08,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 02:15:08,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2019-01-14 02:15:08,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-01-14 02:15:09,375 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2019-01-14 02:15:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:15:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2019-01-14 02:15:09,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2019-01-14 02:15:09,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:09,379 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:09,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:09,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:09,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 02:15:09,826 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2019-01-14 02:15:09,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-01-14 02:15:10,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 430 states and 530 transitions. Complement of second has 216 states. [2019-01-14 02:15:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 17 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:15:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 48 transitions. [2019-01-14 02:15:10,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 19 letters. [2019-01-14 02:15:10,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:10,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 40 letters. Loop has 19 letters. [2019-01-14 02:15:10,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:10,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 38 letters. [2019-01-14 02:15:10,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:10,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 530 transitions. [2019-01-14 02:15:10,827 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2019-01-14 02:15:10,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 202 states and 268 transitions. [2019-01-14 02:15:10,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-01-14 02:15:10,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-01-14 02:15:10,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 268 transitions. [2019-01-14 02:15:10,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:10,835 INFO L706 BuchiCegarLoop]: Abstraction has 202 states and 268 transitions. [2019-01-14 02:15:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 268 transitions. [2019-01-14 02:15:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 156. [2019-01-14 02:15:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-14 02:15:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2019-01-14 02:15:10,862 INFO L729 BuchiCegarLoop]: Abstraction has 156 states and 197 transitions. [2019-01-14 02:15:10,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:15:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:15:10,863 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand 9 states. [2019-01-14 02:15:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:11,138 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2019-01-14 02:15:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 02:15:11,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 187 transitions. [2019-01-14 02:15:11,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:15:11,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 103 states and 122 transitions. [2019-01-14 02:15:11,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2019-01-14 02:15:11,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-14 02:15:11,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 122 transitions. [2019-01-14 02:15:11,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:11,148 INFO L706 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2019-01-14 02:15:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 122 transitions. [2019-01-14 02:15:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-14 02:15:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 02:15:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-01-14 02:15:11,159 INFO L729 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-01-14 02:15:11,159 INFO L609 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-01-14 02:15:11,159 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:15:11,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 118 transitions. [2019-01-14 02:15:11,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:15:11,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:11,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:11,164 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2019-01-14 02:15:11,164 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:11,164 INFO L794 eck$LassoCheckResult]: Stem: 2791#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 2792#L16 call main_#t~ret3 := mc91(main_~x~0);< 2793#mc91ENTRY ~n := #in~n; 2835#L10 assume !(~n > 100); 2810#L11 call #t~ret0 := mc91(11 + ~n);< 2811#mc91ENTRY ~n := #in~n; 2829#L10 assume !(~n > 100); 2823#L11 call #t~ret0 := mc91(11 + ~n);< 2827#mc91ENTRY ~n := #in~n; 2830#L10 assume ~n > 100;#res := ~n - 10; 2828#mc91FINAL assume true; 2826#mc91EXIT >#19#return; 2822#L11-1 call #t~ret1 := mc91(#t~ret0);< 2825#mc91ENTRY ~n := #in~n; 2852#L10 assume ~n > 100;#res := ~n - 10; 2844#mc91FINAL assume true; 2843#mc91EXIT >#21#return; 2841#L11-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 2840#mc91FINAL assume true; 2839#mc91EXIT >#19#return; 2831#L11-1 call #t~ret1 := mc91(#t~ret0);< 2838#mc91ENTRY ~n := #in~n; 2836#L10 assume !(~n > 100); 2803#L11 call #t~ret0 := mc91(11 + ~n);< 2812#mc91ENTRY ~n := #in~n; 2802#L10 assume !(~n > 100); 2795#L11 call #t~ret0 := mc91(11 + ~n);< 2834#mc91ENTRY ~n := #in~n; 2883#L10 assume ~n > 100;#res := ~n - 10; 2882#mc91FINAL assume true; 2794#mc91EXIT >#19#return; 2796#L11-1 [2019-01-14 02:15:11,164 INFO L796 eck$LassoCheckResult]: Loop: 2796#L11-1 call #t~ret1 := mc91(#t~ret0);< 2804#mc91ENTRY ~n := #in~n; 2819#L10 assume !(~n > 100); 2808#L11 call #t~ret0 := mc91(11 + ~n);< 2809#mc91ENTRY ~n := #in~n; 2881#L10 assume ~n > 100;#res := ~n - 10; 2880#mc91FINAL assume true; 2879#mc91EXIT >#19#return; 2796#L11-1 [2019-01-14 02:15:11,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:11,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1788916079, now seen corresponding path program 3 times [2019-01-14 02:15:11,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:11,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:11,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:11,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:11,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 02:15:11,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:15:11,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:15:11,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:15:11,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 02:15:11,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:15:11,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 02:15:11,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:15:11,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2019-01-14 02:15:11,421 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:15:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash 938335010, now seen corresponding path program 2 times [2019-01-14 02:15:11,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:11,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:11,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:11,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:11,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:11,550 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:11,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:11,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:11,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:11,551 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:11,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:11,551 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:11,551 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:11,551 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-14 02:15:11,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:11,552 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:11,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:11,650 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:11,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:11,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:11,661 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:11,661 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:11,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:11,682 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:11,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:11,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:24,246 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:15:24,249 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:24,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:24,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:24,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:24,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:24,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:24,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:24,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:24,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-14 02:15:24,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:24,251 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:24,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:24,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:24,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:24,307 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:24,308 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:24,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:24,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:24,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:24,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:24,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:24,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:24,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:24,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:24,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:24,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:24,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:24,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:24,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:24,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:24,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:24,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:24,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:24,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:24,328 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:15:24,329 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:15:24,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:24,330 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:15:24,330 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:24,330 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2019-01-14 02:15:24,330 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:15:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:24,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:24,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:24,599 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-14 02:15:24,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-14 02:15:24,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-01-14 02:15:24,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2019-01-14 02:15:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:15:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-14 02:15:24,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2019-01-14 02:15:24,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:24,910 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:24,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:25,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:25,125 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-14 02:15:25,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-14 02:15:25,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-01-14 02:15:25,380 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2019-01-14 02:15:25,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:15:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-14 02:15:25,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2019-01-14 02:15:25,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:25,384 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:25,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:25,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:25,605 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-14 02:15:25,606 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-14 02:15:25,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-01-14 02:15:25,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 180 states and 210 transitions. Complement of second has 27 states. [2019-01-14 02:15:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:15:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2019-01-14 02:15:25,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 8 letters. [2019-01-14 02:15:25,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:25,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 39 letters. Loop has 8 letters. [2019-01-14 02:15:25,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:25,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 16 letters. [2019-01-14 02:15:25,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:25,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 210 transitions. [2019-01-14 02:15:25,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:15:25,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 0 states and 0 transitions. [2019-01-14 02:15:25,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:15:25,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:15:25,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:15:25,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:25,953 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:25,953 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:15:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:15:25,954 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2019-01-14 02:15:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:25,954 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:15:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:15:25,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:15:25,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:15:25,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:15:25,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:15:25,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:15:25,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:15:25,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:25,955 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:25,955 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:25,955 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:25,956 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:15:25,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:15:25,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:15:25,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:15:25,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:15:25 BoogieIcfgContainer [2019-01-14 02:15:25,963 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:15:25,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:15:25,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:15:25,964 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:15:25,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:36" (3/4) ... [2019-01-14 02:15:25,968 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:15:25,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:15:25,969 INFO L168 Benchmark]: Toolchain (without parser) took 50193.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -337.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:25,970 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:25,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.60 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:25,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.13 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:25,972 INFO L168 Benchmark]: Boogie Preprocessor took 13.59 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:25,973 INFO L168 Benchmark]: RCFGBuilder took 296.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:25,974 INFO L168 Benchmark]: BuchiAutomizer took 49641.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:25,974 INFO L168 Benchmark]: Witness Printer took 4.88 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:25,980 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.60 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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 29.13 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.59 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 296.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 49641.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.88 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -2 * \old(n) + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * aux-mc91(n+11)-aux + 201 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * n + 189 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(n) + 90 and consists of 20 locations. One nondeterministic module has affine ranking function -2 * aux-mc91(n+11)-aux + 201 and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 49.5s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 40.9s. Construction of modules took 1.4s. Büchi inclusion checks took 6.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 99 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/24 HoareTripleCheckerStatistics: 155 SDtfs, 246 SDslu, 186 SDs, 0 SdLazy, 832 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf96 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf92 smp94 dnf100 smp100 tf110 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 36.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...