./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/rec_counter3.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/termination-numeric/rec_counter3.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 639f18bc5de28da6eb107c1e55f1eb45909efdef ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:29:34,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:34,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:34,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:34,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:34,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:34,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:34,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:34,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:34,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:34,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:34,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:34,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:34,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:34,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:34,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:34,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:34,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:34,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:34,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:34,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:34,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:34,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:34,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:34,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:34,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:34,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:34,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:34,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:34,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:34,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:34,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:34,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:34,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:34,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:34,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:34,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:34,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:34,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:34,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:34,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:34,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:29:34,139 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:34,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:34,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:34,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:34,140 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:34,141 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:34,141 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:34,141 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:34,141 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:34,142 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:34,142 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:34,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:34,142 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:34,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:34,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:34,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:34,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:34,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:34,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:34,144 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:34,144 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:34,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:34,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:34,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:34,145 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:34,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:34,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:34,146 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:34,146 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:34,147 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:34,147 INFO L138 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 -> 639f18bc5de28da6eb107c1e55f1eb45909efdef [2020-07-29 01:29:34,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:29:34,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:29:34,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:29:34,485 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:29:34,486 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:29:34,488 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/rec_counter3.c [2020-07-29 01:29:34,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7136842d/8e78e99b71cc4cfa8176a1b9df276a31/FLAGf64851154 [2020-07-29 01:29:35,011 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:29:35,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/rec_counter3.c [2020-07-29 01:29:35,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7136842d/8e78e99b71cc4cfa8176a1b9df276a31/FLAGf64851154 [2020-07-29 01:29:35,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7136842d/8e78e99b71cc4cfa8176a1b9df276a31 [2020-07-29 01:29:35,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:29:35,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:29:35,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:35,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:29:35,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:29:35,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12513874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35, skipping insertion in model container [2020-07-29 01:29:35,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:29:35,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:29:35,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:35,659 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:29:35,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:35,692 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:29:35,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35 WrapperNode [2020-07-29 01:29:35,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:35,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:35,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:29:35,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:29:35,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:35,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:29:35,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:29:35,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:29:35,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (1/1) ... [2020-07-29 01:29:35,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:29:35,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:29:35,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:29:35,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:29:35,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29: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 [2020-07-29 01:29:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2020-07-29 01:29:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2020-07-29 01:29:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:29:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:29:36,144 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:29:36,144 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:29:36,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:36 BoogieIcfgContainer [2020-07-29 01:29:36,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:29:36,149 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:29:36,150 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:29:36,153 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:29:36,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:36,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:29:35" (1/3) ... [2020-07-29 01:29:36,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3031a6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:36, skipping insertion in model container [2020-07-29 01:29:36,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:36,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:35" (2/3) ... [2020-07-29 01:29:36,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3031a6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:36, skipping insertion in model container [2020-07-29 01:29:36,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:36,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:36" (3/3) ... [2020-07-29 01:29:36,159 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_counter3.c [2020-07-29 01:29:36,215 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:29:36,215 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:29:36,215 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:29:36,215 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:29:36,215 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:29:36,216 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:29:36,216 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:29:36,216 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:29:36,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 01:29:36,264 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-07-29 01:29:36,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:36,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:36,269 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:29:36,270 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:36,270 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:29:36,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 01:29:36,274 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-07-29 01:29:36,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:36,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:36,275 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:29:36,275 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:36,282 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 5#L18true assume !(main_~i~0 <= 0); 9#L20true call main_#t~ret3 := rec(main_~i~0);< 3#recENTRYtrue [2020-07-29 01:29:36,282 INFO L796 eck$LassoCheckResult]: Loop: 3#recENTRYtrue ~a := #in~a; 8#L5true assume !(0 == ~a); 11#L8true call #t~ret0 := rec(~a - 1);< 3#recENTRYtrue [2020-07-29 01:29:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:36,288 INFO L82 PathProgramCache]: Analyzing trace with hash 51816, now seen corresponding path program 1 times [2020-07-29 01:29:36,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:36,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179769625] [2020-07-29 01:29:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:36,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:36,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:36,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 29959, now seen corresponding path program 1 times [2020-07-29 01:29:36,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:36,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879344941] [2020-07-29 01:29:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:36,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:36,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:36,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1543650624, now seen corresponding path program 1 times [2020-07-29 01:29:36,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:36,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414918916] [2020-07-29 01:29:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:36,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:36,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:36,500 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:36,635 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:36,636 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:36,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:36,637 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:36,637 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:36,637 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:36,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:36,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:36,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_counter3.c_Iteration1_Loop [2020-07-29 01:29:36,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:36,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:36,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:36,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:36,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:36,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:36,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:36,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:36,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:36,907 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:36,908 INFO L404 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) [2020-07-29 01:29:36,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:36,916 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:36,926 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:36,927 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~ret0=0} Honda state: {rec_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:36,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:36,969 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:36,973 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:36,974 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~res~0=0} Honda state: {rec_~res~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:37,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,013 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,017 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,017 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~post1=0} Honda state: {rec_#t~post1=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 [2020-07-29 01:29:37,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,053 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,053 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#res=0} Honda state: {rec_#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 [2020-07-29 01:29:37,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,083 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,084 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~a=0} Honda state: {rec_~a=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,114 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:37,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,162 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,163 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#in~a=-8} Honda state: {rec_#in~a=-8} Generalized eigenvectors: [{rec_#in~a=0}, {rec_#in~a=0}, {rec_#in~a=-1}] Lambdas: [2, 0, 1] Nus: [1, 0] 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) [2020-07-29 01:29:37,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,188 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,201 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,201 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~rescopy~0=0} Honda state: {rec_~rescopy~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-07-29 01:29:37,296 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:37,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:37,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:37,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:37,297 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:37,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,298 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:37,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:37,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_counter3.c_Iteration1_Lasso [2020-07-29 01:29:37,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:37,298 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:37,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:37,624 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:37,624 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:37,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,630 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,634 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,634 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,678 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,678 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~ret0=0} Honda state: {rec_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,720 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~post1=0} Honda state: {rec_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:29:37,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,764 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,768 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=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 [2020-07-29 01:29:37,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,804 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,804 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=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 [2020-07-29 01:29:37,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,830 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,830 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#res=0} Honda state: {rec_#res=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 [2020-07-29 01:29:37,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,856 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,856 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~a=0} Honda state: {rec_~a=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2020-07-29 01:29:37,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,883 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0} Honda state: {ULTIMATE.start_main_~i~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:37,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,918 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,918 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~rescopy~0=0} Honda state: {rec_~rescopy~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2020-07-29 01:29:37,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,948 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,948 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~res~0=0} Honda state: {rec_~res~0=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 [2020-07-29 01:29:37,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:37,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:37,978 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:37,979 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret4=0} Honda state: {ULTIMATE.start_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2020-07-29 01:29:38,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:38,012 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:38,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:38,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:38,078 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:38,080 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:38,080 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:38,080 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:38,080 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:38,081 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:38,081 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:38,081 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:38,081 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:38,081 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_counter3.c_Iteration1_Lasso [2020-07-29 01:29:38,081 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:38,081 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:38,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:38,405 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:38,411 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:38,418 INFO L120 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 [2020-07-29 01:29:38,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:38,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:38,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:38,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:38,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:38,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:38,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:38,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:38,491 INFO L120 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 [2020-07-29 01:29:38,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:38,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:38,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:38,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:38,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:38,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:38,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:38,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:38,541 INFO L120 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 [2020-07-29 01:29:38,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:38,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:38,543 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:29:38,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:38,568 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:29:38,569 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:38,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:38,686 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 01:29:38,687 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:38,692 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:38,699 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-07-29 01:29:38,699 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:38,700 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#in~a) = 1*rec_#in~a Supporting invariants [1*rec_#in~a >= 0] [2020-07-29 01:29:38,745 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:38,750 INFO L393 LassoCheck]: Loop: "~a := #in~a;" "assume !(0 == ~a);" "call #t~ret0 := rec(~a - 1);"< [2020-07-29 01:29:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:38,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:38,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:38,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {26#unseeded} is VALID [2020-07-29 01:29:38,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume !(main_~i~0 <= 0); {57#(and (< 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:29:38,843 INFO L263 TraceCheckUtils]: 2: Hoare triple {57#(and (< 0 ULTIMATE.start_main_~i~0) unseeded)} call main_#t~ret3 := rec(main_~i~0); {45#(and (>= |rec_#in~a| 0) unseeded)} is VALID [2020-07-29 01:29:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:38,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:29:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:38,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:38,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(and (>= |rec_#in~a| 0) (>= oldRank0 |rec_#in~a|))} ~a := #in~a; {61#(and (<= 0 rec_~a) (<= rec_~a oldRank0))} is VALID [2020-07-29 01:29:38,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {61#(and (<= 0 rec_~a) (<= rec_~a oldRank0))} assume !(0 == ~a); {65#(and (<= 0 rec_~a) (not (= 0 rec_~a)) (<= rec_~a oldRank0))} is VALID [2020-07-29 01:29:38,907 INFO L263 TraceCheckUtils]: 2: Hoare triple {65#(and (<= 0 rec_~a) (not (= 0 rec_~a)) (<= rec_~a oldRank0))} call #t~ret0 := rec(~a - 1); {48#(and (or (and (> oldRank0 |rec_#in~a|) (>= oldRank0 0)) unseeded) (>= |rec_#in~a| 0))} is VALID [2020-07-29 01:29:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:38,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:38,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:38,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:38,949 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 [2020-07-29 01:29:38,950 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 5 states. [2020-07-29 01:29:39,181 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 5 states. Result 34 states and 42 transitions. Complement of second has 13 states. [2020-07-29 01:29:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:39,182 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:39,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 01:29:39,185 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-07-29 01:29:39,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:39,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:39,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:39,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:39,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:39,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:39,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2020-07-29 01:29:39,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:39,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:39,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:39,194 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states. [2020-07-29 01:29:39,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-07-29 01:29:39,199 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:39,199 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:39,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:39,201 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:39,201 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 42 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:39,202 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:39,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:39,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:39,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:39,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:39,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:39,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:39,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:29:39,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:29:39,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:29:39,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:29:39,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:29:39,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:29:39,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:39,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:39,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:39,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:39,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:39,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:39,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:39,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:39,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:39,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:39,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:39,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:39,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:39,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:39,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:39,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:39,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:39,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:39,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:39,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:39,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:39,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:39,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,217 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2020-07-29 01:29:39,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:39,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:39,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:29:39,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:39,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:39,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:39,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 22 states and 29 transitions. [2020-07-29 01:29:39,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:29:39,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:29:39,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2020-07-29 01:29:39,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:39,240 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-07-29 01:29:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2020-07-29 01:29:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-29 01:29:39,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:39,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 29 transitions. Second operand 20 states. [2020-07-29 01:29:39,276 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 29 transitions. Second operand 20 states. [2020-07-29 01:29:39,279 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 20 states. [2020-07-29 01:29:39,282 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:39,288 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:29:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:29:39,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:39,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:39,290 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states and 29 transitions. [2020-07-29 01:29:39,290 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states and 29 transitions. [2020-07-29 01:29:39,291 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:39,297 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-29 01:29:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2020-07-29 01:29:39,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:39,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:39,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:39,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:29:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-07-29 01:29:39,302 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-29 01:29:39,302 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-29 01:29:39,302 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:29:39,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-07-29 01:29:39,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:39,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:39,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:39,304 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:39,304 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:39,304 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 130#L18 assume !(main_~i~0 <= 0); 124#L20 call main_#t~ret3 := rec(main_~i~0);< 123#recENTRY ~a := #in~a; 126#L5 assume 0 == ~a;#res := 0; 142#recFINAL assume true; 139#recEXIT >#47#return; 132#L20-1 main_~res~1 := main_#t~ret3;havoc main_#t~ret3; 133#L21-2 [2020-07-29 01:29:39,304 INFO L796 eck$LassoCheckResult]: Loop: 133#L21-2 assume !!(main_~res~1 < 1); 133#L21-2 [2020-07-29 01:29:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:39,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1684481175, now seen corresponding path program 1 times [2020-07-29 01:29:39,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:39,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212686295] [2020-07-29 01:29:39,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:29:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {283#true} ~a := #in~a; {290#(= rec_~a |rec_#in~a|)} is VALID [2020-07-29 01:29:39,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {290#(= rec_~a |rec_#in~a|)} assume 0 == ~a;#res := 0; {291#(= 0 |rec_#in~a|)} is VALID [2020-07-29 01:29:39,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {291#(= 0 |rec_#in~a|)} assume true; {291#(= 0 |rec_#in~a|)} is VALID [2020-07-29 01:29:39,406 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {291#(= 0 |rec_#in~a|)} {285#(not (= 0 ULTIMATE.start_main_~i~0))} #47#return; {284#false} is VALID [2020-07-29 01:29:39,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {283#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {283#true} is VALID [2020-07-29 01:29:39,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {283#true} assume !(main_~i~0 <= 0); {285#(not (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:29:39,409 INFO L263 TraceCheckUtils]: 2: Hoare triple {285#(not (= 0 ULTIMATE.start_main_~i~0))} call main_#t~ret3 := rec(main_~i~0); {283#true} is VALID [2020-07-29 01:29:39,409 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} ~a := #in~a; {290#(= rec_~a |rec_#in~a|)} is VALID [2020-07-29 01:29:39,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {290#(= rec_~a |rec_#in~a|)} assume 0 == ~a;#res := 0; {291#(= 0 |rec_#in~a|)} is VALID [2020-07-29 01:29:39,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {291#(= 0 |rec_#in~a|)} assume true; {291#(= 0 |rec_#in~a|)} is VALID [2020-07-29 01:29:39,412 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {291#(= 0 |rec_#in~a|)} {285#(not (= 0 ULTIMATE.start_main_~i~0))} #47#return; {284#false} is VALID [2020-07-29 01:29:39,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {284#false} main_~res~1 := main_#t~ret3;havoc main_#t~ret3; {284#false} is VALID [2020-07-29 01:29:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:39,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212686295] [2020-07-29 01:29:39,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:39,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:29:39,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479812153] [2020-07-29 01:29:39,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:29:39,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:39,419 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-07-29 01:29:39,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:39,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931095251] [2020-07-29 01:29:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:39,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:39,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:39,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:39,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:39,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:29:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:29:39,437 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-07-29 01:29:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:39,541 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:29:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:29:39,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:39,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:39,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2020-07-29 01:29:39,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:39,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 20 transitions. [2020-07-29 01:29:39,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:29:39,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:29:39,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2020-07-29 01:29:39,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:39,561 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:29:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2020-07-29 01:29:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 01:29:39,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:39,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 20 transitions. Second operand 17 states. [2020-07-29 01:29:39,563 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 20 transitions. Second operand 17 states. [2020-07-29 01:29:39,563 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 17 states. [2020-07-29 01:29:39,564 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:39,567 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-29 01:29:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-29 01:29:39,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:39,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:39,568 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 20 transitions. [2020-07-29 01:29:39,568 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 20 transitions. [2020-07-29 01:29:39,569 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:39,572 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-29 01:29:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-29 01:29:39,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:39,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:39,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:39,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:29:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 01:29:39,576 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:29:39,576 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:29:39,576 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:39,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 01:29:39,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:39,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:39,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:39,578 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:39,578 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:39,578 INFO L794 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 322#L18 assume !(main_~i~0 <= 0); 317#L20 call main_#t~ret3 := rec(main_~i~0);< 316#recENTRY ~a := #in~a; 318#L5 assume !(0 == ~a); 320#L8 call #t~ret0 := rec(~a - 1);< 319#recENTRY ~a := #in~a; 321#L5 assume 0 == ~a;#res := 0; 323#recFINAL assume true; 331#recEXIT >#45#return; 329#L8-1 ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; 327#L10-2 [2020-07-29 01:29:39,579 INFO L796 eck$LassoCheckResult]: Loop: 327#L10-2 assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; 327#L10-2 [2020-07-29 01:29:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1511241834, now seen corresponding path program 1 times [2020-07-29 01:29:39,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:39,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848018840] [2020-07-29 01:29:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:39,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:39,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:39,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 46, now seen corresponding path program 1 times [2020-07-29 01:29:39,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:39,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878187552] [2020-07-29 01:29:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:39,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:39,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:39,603 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash -396143387, now seen corresponding path program 1 times [2020-07-29 01:29:39,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:39,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758505813] [2020-07-29 01:29:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:29:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} ~a := #in~a; {452#true} is VALID [2020-07-29 01:29:39,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {452#true} assume 0 == ~a;#res := 0; {460#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:39,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {460#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} assume true; {460#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:39,677 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {460#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} {452#true} #45#return; {458#(= |rec_#t~ret0| 0)} is VALID [2020-07-29 01:29:39,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {452#true} is VALID [2020-07-29 01:29:39,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {452#true} assume !(main_~i~0 <= 0); {452#true} is VALID [2020-07-29 01:29:39,678 INFO L263 TraceCheckUtils]: 2: Hoare triple {452#true} call main_#t~ret3 := rec(main_~i~0); {452#true} is VALID [2020-07-29 01:29:39,679 INFO L280 TraceCheckUtils]: 3: Hoare triple {452#true} ~a := #in~a; {452#true} is VALID [2020-07-29 01:29:39,679 INFO L280 TraceCheckUtils]: 4: Hoare triple {452#true} assume !(0 == ~a); {452#true} is VALID [2020-07-29 01:29:39,679 INFO L263 TraceCheckUtils]: 5: Hoare triple {452#true} call #t~ret0 := rec(~a - 1); {452#true} is VALID [2020-07-29 01:29:39,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {452#true} ~a := #in~a; {452#true} is VALID [2020-07-29 01:29:39,681 INFO L280 TraceCheckUtils]: 7: Hoare triple {452#true} assume 0 == ~a;#res := 0; {460#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:39,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {460#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} assume true; {460#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:39,683 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {460#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} {452#true} #45#return; {458#(= |rec_#t~ret0| 0)} is VALID [2020-07-29 01:29:39,684 INFO L280 TraceCheckUtils]: 10: Hoare triple {458#(= |rec_#t~ret0| 0)} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {459#(= rec_~rescopy~0 0)} is VALID [2020-07-29 01:29:39,685 INFO L280 TraceCheckUtils]: 11: Hoare triple {459#(= rec_~rescopy~0 0)} assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; {453#false} is VALID [2020-07-29 01:29:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:29:39,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758505813] [2020-07-29 01:29:39,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:39,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:29:39,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248095862] [2020-07-29 01:29:39,702 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:39,702 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:39,702 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:39,703 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:39,703 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:39,703 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,703 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:39,703 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:39,703 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_counter3.c_Iteration3_Loop [2020-07-29 01:29:39,703 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:39,704 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:39,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,762 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:39,762 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:39,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:39,766 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:39,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:39,841 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:39,843 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:39,843 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:39,843 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:39,843 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:39,843 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:39,843 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,843 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:39,843 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:39,843 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_counter3.c_Iteration3_Loop [2020-07-29 01:29:39,843 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:39,844 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:39,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,912 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:39,912 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:39,916 INFO L120 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 [2020-07-29 01:29:39,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:39,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:39,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:39,960 INFO L120 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 [2020-07-29 01:29:39,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:39,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:39,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:39,970 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:39,970 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:39,978 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:39,978 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:39,978 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:39,978 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_~rescopy~0) = 1*rec_~rescopy~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,012 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:40,014 INFO L393 LassoCheck]: Loop: "assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1;" [2020-07-29 01:29:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:40,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {461#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {461#unseeded} is VALID [2020-07-29 01:29:40,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {461#unseeded} assume !(main_~i~0 <= 0); {461#unseeded} is VALID [2020-07-29 01:29:40,096 INFO L263 TraceCheckUtils]: 2: Hoare triple {461#unseeded} call main_#t~ret3 := rec(main_~i~0); {461#unseeded} is VALID [2020-07-29 01:29:40,097 INFO L280 TraceCheckUtils]: 3: Hoare triple {461#unseeded} ~a := #in~a; {461#unseeded} is VALID [2020-07-29 01:29:40,098 INFO L280 TraceCheckUtils]: 4: Hoare triple {461#unseeded} assume !(0 == ~a); {461#unseeded} is VALID [2020-07-29 01:29:40,099 INFO L263 TraceCheckUtils]: 5: Hoare triple {461#unseeded} call #t~ret0 := rec(~a - 1); {494#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:40,099 INFO L280 TraceCheckUtils]: 6: Hoare triple {494#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~a := #in~a; {494#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:40,100 INFO L280 TraceCheckUtils]: 7: Hoare triple {494#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~a;#res := 0; {494#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:40,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {494#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {494#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:40,102 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {494#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {461#unseeded} #45#return; {461#unseeded} is VALID [2020-07-29 01:29:40,103 INFO L280 TraceCheckUtils]: 10: Hoare triple {461#unseeded} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {461#unseeded} is VALID [2020-07-29 01:29:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,106 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:40,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {464#(>= oldRank0 rec_~rescopy~0)} assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; {474#(or (and (> oldRank0 rec_~rescopy~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:40,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:40,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:40,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:40,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:29:40,125 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:29:40,216 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 37 states and 49 transitions. Complement of second has 10 states. [2020-07-29 01:29:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:40,217 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:40,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. cyclomatic complexity: 6 [2020-07-29 01:29:40,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:40,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:40,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:40,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:40,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:40,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:40,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 49 transitions. [2020-07-29 01:29:40,222 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:40,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:40,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:40,223 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 6 [2020-07-29 01:29:40,224 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:40,224 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:40,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:40,226 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:40,226 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 49 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:40,227 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:40,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:40,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:40,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:40,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:40,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:40,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:40,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:29:40,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:29:40,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:29:40,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:40,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:40,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:40,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:40,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:40,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:40,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:40,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:40,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:40,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:40,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:40,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:40,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:40,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:40,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:40,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 49 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 1 letters. [2020-07-29 01:29:40,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,239 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:29:40,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:29:40,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 1 letters. [2020-07-29 01:29:40,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:40,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:40,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:40,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:40,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 31 states and 41 transitions. [2020-07-29 01:29:40,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 01:29:40,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:29:40,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2020-07-29 01:29:40,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:40,249 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-07-29 01:29:40,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2020-07-29 01:29:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-29 01:29:40,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:40,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 41 transitions. Second operand 31 states. [2020-07-29 01:29:40,253 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 41 transitions. Second operand 31 states. [2020-07-29 01:29:40,253 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 31 states. [2020-07-29 01:29:40,254 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:40,259 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-29 01:29:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2020-07-29 01:29:40,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:40,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:40,261 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states and 41 transitions. [2020-07-29 01:29:40,261 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states and 41 transitions. [2020-07-29 01:29:40,261 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:40,267 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-29 01:29:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2020-07-29 01:29:40,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:40,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:40,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:40,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:29:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-07-29 01:29:40,270 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-07-29 01:29:40,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:29:40,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:29:40,271 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 5 states. [2020-07-29 01:29:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:40,351 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-07-29 01:29:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:29:40,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:40,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:40,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2020-07-29 01:29:40,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:40,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2020-07-29 01:29:40,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 01:29:40,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:29:40,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2020-07-29 01:29:40,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:40,389 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-07-29 01:29:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2020-07-29 01:29:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-29 01:29:40,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:40,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 35 transitions. Second operand 29 states. [2020-07-29 01:29:40,393 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 35 transitions. Second operand 29 states. [2020-07-29 01:29:40,393 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 29 states. [2020-07-29 01:29:40,394 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:40,398 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-29 01:29:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-07-29 01:29:40,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:40,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:40,400 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states and 35 transitions. [2020-07-29 01:29:40,400 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states and 35 transitions. [2020-07-29 01:29:40,401 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:40,405 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-29 01:29:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-07-29 01:29:40,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:40,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:40,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:40,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:29:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2020-07-29 01:29:40,410 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-07-29 01:29:40,410 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-07-29 01:29:40,410 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:40,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2020-07-29 01:29:40,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:40,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:40,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:40,412 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:40,412 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:40,413 INFO L794 eck$LassoCheckResult]: Stem: 863#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 857#L18 assume !(main_~i~0 <= 0); 850#L20 call main_#t~ret3 := rec(main_~i~0);< 849#recENTRY ~a := #in~a; 851#L5 assume !(0 == ~a); 853#L8 call #t~ret0 := rec(~a - 1);< 852#recENTRY ~a := #in~a; 855#L5 assume 0 == ~a;#res := 0; 860#recFINAL assume true; 869#recEXIT >#45#return; 874#L8-1 ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; 877#L10-2 assume !(~rescopy~0 > 0); 876#L10-3 #res := 1 + ~res~0; 875#recFINAL assume true; 868#recEXIT >#47#return; 858#L20-1 main_~res~1 := main_#t~ret3;havoc main_#t~ret3; 859#L21-2 [2020-07-29 01:29:40,413 INFO L796 eck$LassoCheckResult]: Loop: 859#L21-2 assume !!(main_~res~1 < 1); 859#L21-2 [2020-07-29 01:29:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1423892654, now seen corresponding path program 1 times [2020-07-29 01:29:40,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:40,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783805578] [2020-07-29 01:29:40,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:40,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:40,433 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:40,437 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2020-07-29 01:29:40,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:40,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613648544] [2020-07-29 01:29:40,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:40,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:40,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:40,443 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1190999276, now seen corresponding path program 1 times [2020-07-29 01:29:40,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:40,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084256477] [2020-07-29 01:29:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:29:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:29:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {1099#true} ~a := #in~a; {1099#true} is VALID [2020-07-29 01:29:40,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {1099#true} assume 0 == ~a;#res := 0; {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:40,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} assume true; {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:40,571 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} {1099#true} #45#return; {1119#(= |rec_#t~ret0| 0)} is VALID [2020-07-29 01:29:40,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {1099#true} ~a := #in~a; {1099#true} is VALID [2020-07-29 01:29:40,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {1099#true} assume !(0 == ~a); {1099#true} is VALID [2020-07-29 01:29:40,573 INFO L263 TraceCheckUtils]: 2: Hoare triple {1099#true} call #t~ret0 := rec(~a - 1); {1099#true} is VALID [2020-07-29 01:29:40,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {1099#true} ~a := #in~a; {1099#true} is VALID [2020-07-29 01:29:40,574 INFO L280 TraceCheckUtils]: 4: Hoare triple {1099#true} assume 0 == ~a;#res := 0; {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:40,575 INFO L280 TraceCheckUtils]: 5: Hoare triple {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} assume true; {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:40,577 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} {1099#true} #45#return; {1119#(= |rec_#t~ret0| 0)} is VALID [2020-07-29 01:29:40,578 INFO L280 TraceCheckUtils]: 7: Hoare triple {1119#(= |rec_#t~ret0| 0)} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1120#(<= 0 rec_~res~0)} is VALID [2020-07-29 01:29:40,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {1120#(<= 0 rec_~res~0)} assume !(~rescopy~0 > 0); {1120#(<= 0 rec_~res~0)} is VALID [2020-07-29 01:29:40,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {1120#(<= 0 rec_~res~0)} #res := 1 + ~res~0; {1121#(<= 1 |rec_#res|)} is VALID [2020-07-29 01:29:40,581 INFO L280 TraceCheckUtils]: 10: Hoare triple {1121#(<= 1 |rec_#res|)} assume true; {1121#(<= 1 |rec_#res|)} is VALID [2020-07-29 01:29:40,582 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1121#(<= 1 |rec_#res|)} {1099#true} #47#return; {1113#(<= 1 |ULTIMATE.start_main_#t~ret3|)} is VALID [2020-07-29 01:29:40,583 INFO L280 TraceCheckUtils]: 0: Hoare triple {1099#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {1099#true} is VALID [2020-07-29 01:29:40,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {1099#true} assume !(main_~i~0 <= 0); {1099#true} is VALID [2020-07-29 01:29:40,584 INFO L263 TraceCheckUtils]: 2: Hoare triple {1099#true} call main_#t~ret3 := rec(main_~i~0); {1099#true} is VALID [2020-07-29 01:29:40,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {1099#true} ~a := #in~a; {1099#true} is VALID [2020-07-29 01:29:40,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {1099#true} assume !(0 == ~a); {1099#true} is VALID [2020-07-29 01:29:40,584 INFO L263 TraceCheckUtils]: 5: Hoare triple {1099#true} call #t~ret0 := rec(~a - 1); {1099#true} is VALID [2020-07-29 01:29:40,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {1099#true} ~a := #in~a; {1099#true} is VALID [2020-07-29 01:29:40,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {1099#true} assume 0 == ~a;#res := 0; {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:40,587 INFO L280 TraceCheckUtils]: 8: Hoare triple {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} assume true; {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} is VALID [2020-07-29 01:29:40,588 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1122#(and (<= 0 |rec_#res|) (<= |rec_#res| 0))} {1099#true} #45#return; {1119#(= |rec_#t~ret0| 0)} is VALID [2020-07-29 01:29:40,589 INFO L280 TraceCheckUtils]: 10: Hoare triple {1119#(= |rec_#t~ret0| 0)} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1120#(<= 0 rec_~res~0)} is VALID [2020-07-29 01:29:40,590 INFO L280 TraceCheckUtils]: 11: Hoare triple {1120#(<= 0 rec_~res~0)} assume !(~rescopy~0 > 0); {1120#(<= 0 rec_~res~0)} is VALID [2020-07-29 01:29:40,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {1120#(<= 0 rec_~res~0)} #res := 1 + ~res~0; {1121#(<= 1 |rec_#res|)} is VALID [2020-07-29 01:29:40,592 INFO L280 TraceCheckUtils]: 13: Hoare triple {1121#(<= 1 |rec_#res|)} assume true; {1121#(<= 1 |rec_#res|)} is VALID [2020-07-29 01:29:40,593 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1121#(<= 1 |rec_#res|)} {1099#true} #47#return; {1113#(<= 1 |ULTIMATE.start_main_#t~ret3|)} is VALID [2020-07-29 01:29:40,594 INFO L280 TraceCheckUtils]: 15: Hoare triple {1113#(<= 1 |ULTIMATE.start_main_#t~ret3|)} main_~res~1 := main_#t~ret3;havoc main_#t~ret3; {1114#(<= 1 ULTIMATE.start_main_~res~1)} is VALID [2020-07-29 01:29:40,594 INFO L280 TraceCheckUtils]: 16: Hoare triple {1114#(<= 1 ULTIMATE.start_main_~res~1)} assume !!(main_~res~1 < 1); {1100#false} is VALID [2020-07-29 01:29:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:29:40,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084256477] [2020-07-29 01:29:40,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958199808] [2020-07-29 01:29:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:29:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:40,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {1099#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {1099#true} is VALID [2020-07-29 01:29:40,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {1099#true} assume !(main_~i~0 <= 0); {1099#true} is VALID [2020-07-29 01:29:40,825 INFO L263 TraceCheckUtils]: 2: Hoare triple {1099#true} call main_#t~ret3 := rec(main_~i~0); {1099#true} is VALID [2020-07-29 01:29:40,825 INFO L280 TraceCheckUtils]: 3: Hoare triple {1099#true} ~a := #in~a; {1099#true} is VALID [2020-07-29 01:29:40,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {1099#true} assume !(0 == ~a); {1099#true} is VALID [2020-07-29 01:29:40,826 INFO L263 TraceCheckUtils]: 5: Hoare triple {1099#true} call #t~ret0 := rec(~a - 1); {1099#true} is VALID [2020-07-29 01:29:40,826 INFO L280 TraceCheckUtils]: 6: Hoare triple {1099#true} ~a := #in~a; {1099#true} is VALID [2020-07-29 01:29:40,827 INFO L280 TraceCheckUtils]: 7: Hoare triple {1099#true} assume 0 == ~a;#res := 0; {1147#(<= 0 |rec_#res|)} is VALID [2020-07-29 01:29:40,828 INFO L280 TraceCheckUtils]: 8: Hoare triple {1147#(<= 0 |rec_#res|)} assume true; {1147#(<= 0 |rec_#res|)} is VALID [2020-07-29 01:29:40,829 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1147#(<= 0 |rec_#res|)} {1099#true} #45#return; {1154#(<= 0 |rec_#t~ret0|)} is VALID [2020-07-29 01:29:40,829 INFO L280 TraceCheckUtils]: 10: Hoare triple {1154#(<= 0 |rec_#t~ret0|)} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1120#(<= 0 rec_~res~0)} is VALID [2020-07-29 01:29:40,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {1120#(<= 0 rec_~res~0)} assume !(~rescopy~0 > 0); {1120#(<= 0 rec_~res~0)} is VALID [2020-07-29 01:29:40,832 INFO L280 TraceCheckUtils]: 12: Hoare triple {1120#(<= 0 rec_~res~0)} #res := 1 + ~res~0; {1121#(<= 1 |rec_#res|)} is VALID [2020-07-29 01:29:40,832 INFO L280 TraceCheckUtils]: 13: Hoare triple {1121#(<= 1 |rec_#res|)} assume true; {1121#(<= 1 |rec_#res|)} is VALID [2020-07-29 01:29:40,834 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1121#(<= 1 |rec_#res|)} {1099#true} #47#return; {1113#(<= 1 |ULTIMATE.start_main_#t~ret3|)} is VALID [2020-07-29 01:29:40,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {1113#(<= 1 |ULTIMATE.start_main_#t~ret3|)} main_~res~1 := main_#t~ret3;havoc main_#t~ret3; {1114#(<= 1 ULTIMATE.start_main_~res~1)} is VALID [2020-07-29 01:29:40,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {1114#(<= 1 ULTIMATE.start_main_~res~1)} assume !!(main_~res~1 < 1); {1100#false} is VALID [2020-07-29 01:29:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:29:40,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:29:40,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2020-07-29 01:29:40,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661810088] [2020-07-29 01:29:40,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:29:40,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:29:40,845 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-07-29 01:29:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:41,004 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-29 01:29:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:29:41,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:29:41,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:41,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2020-07-29 01:29:41,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:41,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 26 transitions. [2020-07-29 01:29:41,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:29:41,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:29:41,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2020-07-29 01:29:41,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:41,039 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 01:29:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2020-07-29 01:29:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2020-07-29 01:29:41,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:41,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 26 transitions. Second operand 19 states. [2020-07-29 01:29:41,044 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 26 transitions. Second operand 19 states. [2020-07-29 01:29:41,045 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 19 states. [2020-07-29 01:29:41,045 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:41,051 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-29 01:29:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-29 01:29:41,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:41,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:41,053 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 22 states and 26 transitions. [2020-07-29 01:29:41,053 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 22 states and 26 transitions. [2020-07-29 01:29:41,054 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:41,061 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-29 01:29:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-29 01:29:41,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:41,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:41,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:41,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:29:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-07-29 01:29:41,068 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-29 01:29:41,068 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-29 01:29:41,068 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:29:41,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2020-07-29 01:29:41,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:41,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:41,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:41,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:41,074 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:41,074 INFO L794 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 1215#L18 assume !(main_~i~0 <= 0); 1205#L20 call main_#t~ret3 := rec(main_~i~0);< 1204#recENTRY ~a := #in~a; 1206#L5 assume !(0 == ~a); 1208#L8 call #t~ret0 := rec(~a - 1);< 1207#recENTRY ~a := #in~a; 1211#L5 assume !(0 == ~a); 1209#L8 call #t~ret0 := rec(~a - 1);< 1207#recENTRY ~a := #in~a; 1210#L5 assume 0 == ~a;#res := 0; 1220#recFINAL assume true; 1222#recEXIT >#45#return; 1221#L8-1 ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; 1212#L10-2 assume !(~rescopy~0 > 0); 1213#L10-3 #res := 1 + ~res~0; 1218#recFINAL assume true; 1219#recEXIT >#45#return; 1216#L8-1 ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; 1217#L10-2 [2020-07-29 01:29:41,074 INFO L796 eck$LassoCheckResult]: Loop: 1217#L10-2 assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; 1217#L10-2 [2020-07-29 01:29:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash -274003163, now seen corresponding path program 1 times [2020-07-29 01:29:41,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:41,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613896933] [2020-07-29 01:29:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:41,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:41,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:41,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash 46, now seen corresponding path program 2 times [2020-07-29 01:29:41,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:41,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491071003] [2020-07-29 01:29:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:41,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:41,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:41,143 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash 95836554, now seen corresponding path program 1 times [2020-07-29 01:29:41,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:41,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665987667] [2020-07-29 01:29:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:41,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:41,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:41,196 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:41,211 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:41,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:41,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:41,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:41,211 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:41,211 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:41,212 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:41,212 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:41,212 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_counter3.c_Iteration5_Loop [2020-07-29 01:29:41,212 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:41,212 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:41,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:41,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:41,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:41,272 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:41,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:41,279 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:41,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:41,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:41,342 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:41,343 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:41,344 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:41,344 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:41,344 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:41,344 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:41,344 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:41,344 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:41,344 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:41,344 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_counter3.c_Iteration5_Loop [2020-07-29 01:29:41,344 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:41,345 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:41,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:41,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:41,408 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:41,408 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:41,411 INFO L120 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 [2020-07-29 01:29:41,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:41,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:41,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:41,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:41,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:41,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:41,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:41,418 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:41,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:41,428 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:41,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:41,434 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:41,434 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:41,434 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_~rescopy~0) = 1*rec_~rescopy~0 Supporting invariants [] [2020-07-29 01:29:41,461 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:41,464 INFO L393 LassoCheck]: Loop: "assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1;" [2020-07-29 01:29:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:41,569 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:41,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {1412#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {1412#unseeded} is VALID [2020-07-29 01:29:41,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {1412#unseeded} assume !(main_~i~0 <= 0); {1412#unseeded} is VALID [2020-07-29 01:29:41,581 INFO L263 TraceCheckUtils]: 2: Hoare triple {1412#unseeded} call main_#t~ret3 := rec(main_~i~0); {1412#unseeded} is VALID [2020-07-29 01:29:41,581 INFO L280 TraceCheckUtils]: 3: Hoare triple {1412#unseeded} ~a := #in~a; {1412#unseeded} is VALID [2020-07-29 01:29:41,582 INFO L280 TraceCheckUtils]: 4: Hoare triple {1412#unseeded} assume !(0 == ~a); {1412#unseeded} is VALID [2020-07-29 01:29:41,584 INFO L263 TraceCheckUtils]: 5: Hoare triple {1412#unseeded} call #t~ret0 := rec(~a - 1); {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,584 INFO L280 TraceCheckUtils]: 6: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~a := #in~a; {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~a); {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,587 INFO L263 TraceCheckUtils]: 8: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec(~a - 1); {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~a := #in~a; {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,588 INFO L280 TraceCheckUtils]: 10: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~a;#res := 0; {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,589 INFO L280 TraceCheckUtils]: 11: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,591 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,592 INFO L280 TraceCheckUtils]: 13: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,593 INFO L280 TraceCheckUtils]: 14: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~rescopy~0 > 0); {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,593 INFO L280 TraceCheckUtils]: 15: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + ~res~0; {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,594 INFO L280 TraceCheckUtils]: 16: Hoare triple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,596 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1445#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1412#unseeded} #45#return; {1412#unseeded} is VALID [2020-07-29 01:29:41,597 INFO L280 TraceCheckUtils]: 18: Hoare triple {1412#unseeded} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1412#unseeded} is VALID [2020-07-29 01:29:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,601 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:41,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {1415#(>= oldRank0 rec_~rescopy~0)} assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; {1425#(or (and (> oldRank0 rec_~rescopy~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:41,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:41,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:41,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,725 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:29:41,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:29:41,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 7 states. [2020-07-29 01:29:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:41,814 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:41,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:41,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:41,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:41,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:41,819 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:41,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:41,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-07-29 01:29:41,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:41,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:41,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:41,821 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:41,821 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:41,821 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:41,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:41,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 13 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:41,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:41,828 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:41,828 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 29 transitions. cyclomatic complexity: 6 [2020-07-29 01:29:41,829 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:41,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:41,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:41,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:41,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:41,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:41,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:41,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:41,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:41,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:41,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,842 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 01:29:41,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,844 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:41,923 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:41,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {1412#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {1412#unseeded} is VALID [2020-07-29 01:29:41,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {1412#unseeded} assume !(main_~i~0 <= 0); {1412#unseeded} is VALID [2020-07-29 01:29:41,930 INFO L263 TraceCheckUtils]: 2: Hoare triple {1412#unseeded} call main_#t~ret3 := rec(main_~i~0); {1412#unseeded} is VALID [2020-07-29 01:29:41,931 INFO L280 TraceCheckUtils]: 3: Hoare triple {1412#unseeded} ~a := #in~a; {1412#unseeded} is VALID [2020-07-29 01:29:41,931 INFO L280 TraceCheckUtils]: 4: Hoare triple {1412#unseeded} assume !(0 == ~a); {1412#unseeded} is VALID [2020-07-29 01:29:41,932 INFO L263 TraceCheckUtils]: 5: Hoare triple {1412#unseeded} call #t~ret0 := rec(~a - 1); {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,933 INFO L280 TraceCheckUtils]: 6: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~a := #in~a; {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~a); {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,935 INFO L263 TraceCheckUtils]: 8: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec(~a - 1); {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,936 INFO L280 TraceCheckUtils]: 9: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~a := #in~a; {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,936 INFO L280 TraceCheckUtils]: 10: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~a;#res := 0; {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,937 INFO L280 TraceCheckUtils]: 11: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,939 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,940 INFO L280 TraceCheckUtils]: 13: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,940 INFO L280 TraceCheckUtils]: 14: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~rescopy~0 > 0); {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,941 INFO L280 TraceCheckUtils]: 15: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + ~res~0; {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,942 INFO L280 TraceCheckUtils]: 16: Hoare triple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:41,943 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1540#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1412#unseeded} #45#return; {1412#unseeded} is VALID [2020-07-29 01:29:41,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {1412#unseeded} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1412#unseeded} is VALID [2020-07-29 01:29:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,947 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:41,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:41,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {1415#(>= oldRank0 rec_~rescopy~0)} assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; {1425#(or (and (> oldRank0 rec_~rescopy~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:41,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:41,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:41,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:41,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:41,972 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:29:41,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:29:42,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 7 states. [2020-07-29 01:29:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:42,026 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:42,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:42,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:42,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:42,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:42,027 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:42,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:42,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-07-29 01:29:42,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:42,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:42,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:42,030 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:42,030 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:42,030 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:42,031 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:42,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 13 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:42,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:42,031 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:42,032 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 29 transitions. cyclomatic complexity: 6 [2020-07-29 01:29:42,032 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:42,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:42,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:42,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:42,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:42,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:42,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:42,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:42,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:42,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:42,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,041 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 01:29:42,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,043 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:42,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:42,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:42,122 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:42,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {1412#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; {1412#unseeded} is VALID [2020-07-29 01:29:42,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {1412#unseeded} assume !(main_~i~0 <= 0); {1412#unseeded} is VALID [2020-07-29 01:29:42,133 INFO L263 TraceCheckUtils]: 2: Hoare triple {1412#unseeded} call main_#t~ret3 := rec(main_~i~0); {1412#unseeded} is VALID [2020-07-29 01:29:42,133 INFO L280 TraceCheckUtils]: 3: Hoare triple {1412#unseeded} ~a := #in~a; {1412#unseeded} is VALID [2020-07-29 01:29:42,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {1412#unseeded} assume !(0 == ~a); {1412#unseeded} is VALID [2020-07-29 01:29:42,135 INFO L263 TraceCheckUtils]: 5: Hoare triple {1412#unseeded} call #t~ret0 := rec(~a - 1); {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,136 INFO L280 TraceCheckUtils]: 6: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~a := #in~a; {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,136 INFO L280 TraceCheckUtils]: 7: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~a); {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,137 INFO L263 TraceCheckUtils]: 8: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec(~a - 1); {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,138 INFO L280 TraceCheckUtils]: 9: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~a := #in~a; {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,139 INFO L280 TraceCheckUtils]: 10: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~a;#res := 0; {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,139 INFO L280 TraceCheckUtils]: 11: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,142 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,143 INFO L280 TraceCheckUtils]: 13: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~rescopy~0 > 0); {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,144 INFO L280 TraceCheckUtils]: 15: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + ~res~0; {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,145 INFO L280 TraceCheckUtils]: 16: Hoare triple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:42,147 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1635#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1412#unseeded} #45#return; {1412#unseeded} is VALID [2020-07-29 01:29:42,147 INFO L280 TraceCheckUtils]: 18: Hoare triple {1412#unseeded} ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; {1412#unseeded} is VALID [2020-07-29 01:29:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:42,151 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:42,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:42,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {1415#(>= oldRank0 rec_~rescopy~0)} assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; {1425#(or (and (> oldRank0 rec_~rescopy~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:42,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:42,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:42,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,180 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 1 loop predicates [2020-07-29 01:29:42,180 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:29:42,249 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 32 states and 40 transitions. Complement of second has 9 states. [2020-07-29 01:29:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:42,249 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:42,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:42,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:42,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:42,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:42,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:42,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:42,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:42,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 40 transitions. [2020-07-29 01:29:42,252 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:42,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:42,252 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 22 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:42,253 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:42,253 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:42,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:42,254 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:42,254 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 40 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:42,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 40 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:42,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:42,254 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:42,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:42,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:42,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:42,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:42,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:42,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:42,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:42,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:42,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 22 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,263 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:29:42,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 1 letters. [2020-07-29 01:29:42,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 20 letters. Loop has 1 letters. [2020-07-29 01:29:42,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:29:42,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:42,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:42,267 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:42,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2020-07-29 01:29:42,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:42,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:42,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:42,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:42,268 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:42,268 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:42,268 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:42,268 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:29:42,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:29:42,268 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:42,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:42,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:42 BoogieIcfgContainer [2020-07-29 01:29:42,275 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:42,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:42,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:42,276 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:42,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:36" (3/4) ... [2020-07-29 01:29:42,280 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:29:42,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:42,284 INFO L168 Benchmark]: Toolchain (without parser) took 6876.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.8 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -241.9 MB). Peak memory consumption was 77.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:42,284 INFO L168 Benchmark]: CDTParser took 1.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:42,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.76 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:42,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:42,286 INFO L168 Benchmark]: Boogie Preprocessor took 18.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:42,287 INFO L168 Benchmark]: RCFGBuilder took 342.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:42,287 INFO L168 Benchmark]: BuchiAutomizer took 6126.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.5 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:42,288 INFO L168 Benchmark]: Witness Printer took 4.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:42,291 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.76 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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 92.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 342.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6126.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.5 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function \old(a) and consists of 5 locations. One deterministic module has affine ranking function rescopy and consists of 4 locations. One nondeterministic module has affine ranking function rescopy and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 3.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 100 SDslu, 151 SDs, 0 SdLazy, 89 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT1 SILN1 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf97 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq169 hnf94 smp100 dnf124 smp100 tf108 neg97 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 163ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...