./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-crafted/MutualRecursion_1a.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 727b654585befeb7272249307a5de272b17c4e2d2d1afa67fd11f4eb185d7508 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:30,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:30,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:30,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:30,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:30,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:30,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:30,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:30,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:30,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:30,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:30,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:30,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:30,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:30,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:30,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:30,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:30,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:30,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:30,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:30,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:30,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:30,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:30,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:30,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:30,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:30,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:30,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:30,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:30,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:30,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:30,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:30,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:30,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:30,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:30,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:30,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:30,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:30,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:30,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:30,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:30,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:23:30,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:30,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:30,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:30,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:30,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:30,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:30,366 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:30,367 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:30,367 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:30,367 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:30,383 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:30,383 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:30,383 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:30,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:30,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:30,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:30,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:30,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:30,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:30,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:30,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:30,384 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:30,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:30,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:30,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:30,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:30,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:30,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:30,386 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:30,386 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 727b654585befeb7272249307a5de272b17c4e2d2d1afa67fd11f4eb185d7508 [2022-02-21 03:23:30,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:30,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:30,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:30,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:30,647 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:30,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2022-02-21 03:23:30,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61eb8db50/af433b7850754645b1a955e751bfbe04/FLAG682e5417a [2022-02-21 03:23:31,031 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:31,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2022-02-21 03:23:31,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61eb8db50/af433b7850754645b1a955e751bfbe04/FLAG682e5417a [2022-02-21 03:23:31,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61eb8db50/af433b7850754645b1a955e751bfbe04 [2022-02-21 03:23:31,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:31,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:31,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:31,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:31,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:31,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74582e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31, skipping insertion in model container [2022-02-21 03:23:31,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:31,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:31,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:31,655 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:31,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:31,684 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:31,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31 WrapperNode [2022-02-21 03:23:31,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:31,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:31,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:31,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:31,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,717 INFO L137 Inliner]: procedures = 6, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6 [2022-02-21 03:23:31,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:31,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:31,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:31,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:31,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:31,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:31,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:31,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:31,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (1/1) ... [2022-02-21 03:23:31,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:31,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:31,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:31,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:23:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-21 03:23:31,851 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-21 03:23:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:23:31,851 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:23:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:31,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:31,899 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:31,900 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:32,060 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:32,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:32,065 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:23:32,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:32 BoogieIcfgContainer [2022-02-21 03:23:32,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:32,067 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:32,067 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:32,081 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:32,082 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:32,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:31" (1/3) ... [2022-02-21 03:23:32,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42d82f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:32, skipping insertion in model container [2022-02-21 03:23:32,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:32,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:31" (2/3) ... [2022-02-21 03:23:32,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42d82f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:32, skipping insertion in model container [2022-02-21 03:23:32,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:32,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:32" (3/3) ... [2022-02-21 03:23:32,094 INFO L388 chiAutomizerObserver]: Analyzing ICFG MutualRecursion_1a.c [2022-02-21 03:23:32,181 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:32,181 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:32,181 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:32,181 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:32,181 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:32,181 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:32,181 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:32,181 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:32,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:23:32,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:32,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:32,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:32,260 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:32,260 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:23:32,260 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:32,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:23:32,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:32,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:32,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:32,269 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:32,269 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:23:32,273 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13#L26true call main_#t~ret5#1 := g(main_~x~0#1);< 15#gENTRYtrue [2022-02-21 03:23:32,274 INFO L793 eck$LassoCheckResult]: Loop: 15#gENTRYtrue ~x := #in~x; 7#L19true assume !(~x <= 0); 12#L20true call #t~ret2 := f(~x - 1);< 16#fENTRYtrue ~x := #in~x; 19#L13true assume !(~x <= 0); 10#L14true call #t~ret0 := g(~x);< 15#gENTRYtrue [2022-02-21 03:23:32,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash 47743, now seen corresponding path program 1 times [2022-02-21 03:23:32,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:32,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689091454] [2022-02-21 03:23:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:32,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:32,433 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1158065693, now seen corresponding path program 1 times [2022-02-21 03:23:32,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:32,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765062575] [2022-02-21 03:23:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:32,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:32,481 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1788538341, now seen corresponding path program 1 times [2022-02-21 03:23:32,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:32,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001935653] [2022-02-21 03:23:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:32,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:32,509 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:32,717 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:32,718 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:32,718 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:32,718 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:32,718 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:32,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:32,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:32,719 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:32,719 INFO L133 ssoRankerPreferences]: Filename of dumped script: MutualRecursion_1a.c_Iteration1_Loop [2022-02-21 03:23:32,719 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:32,719 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:32,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:32,832 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:32,833 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:32,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:32,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:32,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:32,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:23:32,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:32,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:32,902 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:32,902 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#res=0} Honda state: {f_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:32,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:32,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:32,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:32,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:32,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:23:32,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:32,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:32,962 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:32,962 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret2=0} Honda state: {g_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:32,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:32,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:32,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:32,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:32,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:23:32,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:32,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:33,000 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:33,000 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret3=0} Honda state: {g_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:33,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:33,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:33,045 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:33,045 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#in~x=0} Honda state: {f_#in~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:33,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:23:33,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:23:33,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:33,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:33,090 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:33,090 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:33,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,111 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:23:33,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:33,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:33,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:23:33,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,155 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:23:33,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:33,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:33,237 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:33,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:23:33,241 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:33,241 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:33,241 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:33,241 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:33,241 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:33,241 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,241 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:33,241 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:33,241 INFO L133 ssoRankerPreferences]: Filename of dumped script: MutualRecursion_1a.c_Iteration1_Loop [2022-02-21 03:23:33,241 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:33,241 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:33,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:33,355 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:33,358 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:33,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,385 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:23:33,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:33,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:33,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:33,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:33,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:33,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:33,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:33,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:33,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:33,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,429 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:23:33,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:33,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:33,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:33,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:33,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:33,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:33,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:33,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:33,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:33,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,467 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:23:33,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:33,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:33,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:33,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:33,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:33,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:33,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:33,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:33,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:33,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,514 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:23:33,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:33,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:33,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:33,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:33,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:33,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:33,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:33,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:33,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:33,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,543 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:23:33,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:33,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:33,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:33,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:33,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:33,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:33,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:33,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:33,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:33,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,597 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:23:33,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:33,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:33,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:33,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:33,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:33,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:33,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:33,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:33,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:33,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,625 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:23:33,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:33,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:33,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:33,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:33,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:33,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:33,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:33,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:33,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:33,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:33,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,678 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:23:33,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:33,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:33,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:33,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:33,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:33,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:33,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:33,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:33,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:33,705 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:23:33,705 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:23:33,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:33,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:33,726 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:33,747 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:33,747 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:33,747 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:33,747 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [] [2022-02-21 03:23:33,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:23:33,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:23:33,785 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:33,789 INFO L390 LassoCheck]: Loop: "~x := #in~x;" "assume !(~x <= 0);" "call #t~ret2 := f(~x - 1);"< "~x := #in~x;" "assume !(~x <= 0);" "call #t~ret0 := g(~x);"< [2022-02-21 03:23:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:33,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:23:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:33,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:33,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#unseeded} assume { :begin_inline_ULTIMATE.init } true; {31#unseeded} is VALID [2022-02-21 03:23:33,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {31#unseeded} is VALID [2022-02-21 03:23:33,854 INFO L272 TraceCheckUtils]: 2: Hoare triple {31#unseeded} call main_#t~ret5#1 := g(main_~x~0#1); {31#unseeded} is VALID [2022-02-21 03:23:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:33,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:23:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:33,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:34,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(>= oldRank0 |g_#in~x|)} ~x := #in~x; {55#(<= g_~x oldRank0)} is VALID [2022-02-21 03:23:34,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#(<= g_~x oldRank0)} assume !(~x <= 0); {55#(<= g_~x oldRank0)} is VALID [2022-02-21 03:23:34,014 INFO L272 TraceCheckUtils]: 2: Hoare triple {55#(<= g_~x oldRank0)} call #t~ret2 := f(~x - 1); {62#(<= (+ |f_#in~x| 1) oldRank0)} is VALID [2022-02-21 03:23:34,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#(<= (+ |f_#in~x| 1) oldRank0)} ~x := #in~x; {66#(<= (+ f_~x 1) oldRank0)} is VALID [2022-02-21 03:23:34,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {66#(<= (+ f_~x 1) oldRank0)} assume !(~x <= 0); {70#(and (not (<= f_~x 0)) (<= (+ f_~x 1) oldRank0))} is VALID [2022-02-21 03:23:34,016 INFO L272 TraceCheckUtils]: 5: Hoare triple {70#(and (not (<= f_~x 0)) (<= (+ f_~x 1) oldRank0))} call #t~ret0 := g(~x); {44#(or (and (>= oldRank0 0) (> oldRank0 |g_#in~x|)) unseeded)} is VALID [2022-02-21 03:23:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:34,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:34,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:34,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:34,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,049 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:23:34,050 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:34,246 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5). Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 82 transitions. Complement of second has 24 states. [2022-02-21 03:23:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:34,247 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:34,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:23:34,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:34,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:34,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:34,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:34,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:23:34,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:34,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:34,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 82 transitions. [2022-02-21 03:23:34,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:34,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:34,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:34,256 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:23:34,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:34,260 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:23:34,260 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:34,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:23:34,261 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:34,261 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 82 transitions. cyclomatic complexity: 21 [2022-02-21 03:23:34,265 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:23:34,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:34,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:34,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:34,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:23:34,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:23:34,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:23:34,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:23:34,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:23:34,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:23:34,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:23:34,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:23:34,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:23:34,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:23:34,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:23:34,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:23:34,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 10 letters. Loop has 11 letters. [2022-02-21 03:23:34,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 11 letters. [2022-02-21 03:23:34,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 11 letters. [2022-02-21 03:23:34,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:34,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:34,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:34,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:23:34,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:23:34,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:23:34,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:23:34,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:23:34,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:23:34,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:23:34,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:23:34,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:23:34,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:23:34,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:23:34,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:23:34,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:23:34,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:23:34,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:23:34,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 10 letters. Loop has 11 letters. [2022-02-21 03:23:34,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 11 letters. [2022-02-21 03:23:34,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 11 letters. [2022-02-21 03:23:34,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:34,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:23:34,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:23:34,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:23:34,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:23:34,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:23:34,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:23:34,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:23:34,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:23:34,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:23:34,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 21 letters. Loop has 22 letters. [2022-02-21 03:23:34,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 22 letters. [2022-02-21 03:23:34,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 22 letters. [2022-02-21 03:23:34,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:23:34,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:23:34,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:23:34,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:23:34,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:23:34,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:23:34,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:23:34,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:23:34,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:23:34,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:23:34,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:23:34,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:23:34,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:23:34,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 21 letters. Loop has 22 letters. [2022-02-21 03:23:34,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 22 letters. [2022-02-21 03:23:34,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 82 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 22 letters. [2022-02-21 03:23:34,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,314 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-02-21 03:23:34,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:34,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:23:34,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2022-02-21 03:23:34,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:34,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. cyclomatic complexity: 21 [2022-02-21 03:23:34,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:34,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 46 states and 60 transitions. [2022-02-21 03:23:34,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 03:23:34,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-02-21 03:23:34,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 60 transitions. [2022-02-21 03:23:34,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:34,334 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-02-21 03:23:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 60 transitions. [2022-02-21 03:23:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-02-21 03:23:34,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:34,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 60 transitions. Second operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 03:23:34,355 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 60 transitions. Second operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 03:23:34,356 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 03:23:34,358 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:34,366 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2022-02-21 03:23:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2022-02-21 03:23:34,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:34,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:34,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Second operand 46 states and 60 transitions. [2022-02-21 03:23:34,369 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Second operand 46 states and 60 transitions. [2022-02-21 03:23:34,369 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:34,378 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2022-02-21 03:23:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2022-02-21 03:23:34,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:34,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:34,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:34,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 03:23:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-02-21 03:23:34,384 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-02-21 03:23:34,384 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-02-21 03:23:34,384 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:34,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2022-02-21 03:23:34,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:34,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:34,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:34,386 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:34,386 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:34,386 INFO L791 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 191#L26 call main_#t~ret5#1 := g(main_~x~0#1);< 197#gENTRY ~x := #in~x; 190#L19 assume !(~x <= 0); 174#L20 call #t~ret2 := f(~x - 1);< 196#fENTRY ~x := #in~x; 206#L13 assume !(~x <= 0); 187#L14 call #t~ret0 := g(~x);< 194#gENTRY ~x := #in~x; 186#L19 assume ~x <= 0;#res := 0; 188#gFINAL assume true; 192#gEXIT >#27#return; 182#L14-1 [2022-02-21 03:23:34,386 INFO L793 eck$LassoCheckResult]: Loop: 182#L14-1 call #t~ret1 := g(1 + ~x);< 185#gENTRY ~x := #in~x; 210#L19 assume !(~x <= 0); 183#L20 call #t~ret2 := f(~x - 1);< 209#fENTRY ~x := #in~x; 207#L13 assume !(~x <= 0); 193#L14 call #t~ret0 := g(~x);< 185#gENTRY ~x := #in~x; 210#L19 assume ~x <= 0;#res := 0; 205#gFINAL assume true; 208#gEXIT >#27#return; 182#L14-1 [2022-02-21 03:23:34,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:34,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1510789928, now seen corresponding path program 1 times [2022-02-21 03:23:34,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:34,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058612368] [2022-02-21 03:23:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:23:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:34,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {621#true} ~x := #in~x; {628#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:23:34,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {628#(= |g_#in~x| g_~x)} assume ~x <= 0;#res := 0; {629#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:34,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#(<= |g_#in~x| 0)} assume true; {629#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:34,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#(<= |g_#in~x| 0)} {623#(<= 1 f_~x)} #27#return; {622#false} is VALID [2022-02-21 03:23:34,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {621#true} assume { :begin_inline_ULTIMATE.init } true; {621#true} is VALID [2022-02-21 03:23:34,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {621#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {621#true} is VALID [2022-02-21 03:23:34,488 INFO L272 TraceCheckUtils]: 2: Hoare triple {621#true} call main_#t~ret5#1 := g(main_~x~0#1); {621#true} is VALID [2022-02-21 03:23:34,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {621#true} ~x := #in~x; {621#true} is VALID [2022-02-21 03:23:34,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {621#true} assume !(~x <= 0); {621#true} is VALID [2022-02-21 03:23:34,489 INFO L272 TraceCheckUtils]: 5: Hoare triple {621#true} call #t~ret2 := f(~x - 1); {621#true} is VALID [2022-02-21 03:23:34,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#true} ~x := #in~x; {621#true} is VALID [2022-02-21 03:23:34,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#true} assume !(~x <= 0); {623#(<= 1 f_~x)} is VALID [2022-02-21 03:23:34,500 INFO L272 TraceCheckUtils]: 8: Hoare triple {623#(<= 1 f_~x)} call #t~ret0 := g(~x); {621#true} is VALID [2022-02-21 03:23:34,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#true} ~x := #in~x; {628#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:23:34,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {628#(= |g_#in~x| g_~x)} assume ~x <= 0;#res := 0; {629#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:34,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(<= |g_#in~x| 0)} assume true; {629#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:34,502 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {629#(<= |g_#in~x| 0)} {623#(<= 1 f_~x)} #27#return; {622#false} is VALID [2022-02-21 03:23:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:23:34,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:34,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058612368] [2022-02-21 03:23:34,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058612368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:34,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:34,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:23:34,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558960976] [2022-02-21 03:23:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:34,505 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:34,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1553130012, now seen corresponding path program 1 times [2022-02-21 03:23:34,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:34,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717157628] [2022-02-21 03:23:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 03:23:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:34,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#true} ~x := #in~x; {637#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:23:34,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {637#(= |g_#in~x| g_~x)} assume ~x <= 0;#res := 0; {638#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:34,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {638#(<= |g_#in~x| 0)} assume true; {638#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:34,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {638#(<= |g_#in~x| 0)} {632#(<= 1 f_~x)} #27#return; {631#false} is VALID [2022-02-21 03:23:34,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {630#true} call #t~ret1 := g(1 + ~x); {630#true} is VALID [2022-02-21 03:23:34,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#true} ~x := #in~x; {630#true} is VALID [2022-02-21 03:23:34,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#true} assume !(~x <= 0); {630#true} is VALID [2022-02-21 03:23:34,543 INFO L272 TraceCheckUtils]: 3: Hoare triple {630#true} call #t~ret2 := f(~x - 1); {630#true} is VALID [2022-02-21 03:23:34,543 INFO L290 TraceCheckUtils]: 4: Hoare triple {630#true} ~x := #in~x; {630#true} is VALID [2022-02-21 03:23:34,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#true} assume !(~x <= 0); {632#(<= 1 f_~x)} is VALID [2022-02-21 03:23:34,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {632#(<= 1 f_~x)} call #t~ret0 := g(~x); {630#true} is VALID [2022-02-21 03:23:34,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {630#true} ~x := #in~x; {637#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:23:34,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {637#(= |g_#in~x| g_~x)} assume ~x <= 0;#res := 0; {638#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:34,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(<= |g_#in~x| 0)} assume true; {638#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:34,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {638#(<= |g_#in~x| 0)} {632#(<= 1 f_~x)} #27#return; {631#false} is VALID [2022-02-21 03:23:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:23:34,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:34,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717157628] [2022-02-21 03:23:34,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717157628] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:34,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:34,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:23:34,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935188814] [2022-02-21 03:23:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:34,547 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:23:34,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:34,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:23:34,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:23:34,550 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. cyclomatic complexity: 14 Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:34,633 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-02-21 03:23:34,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:23:34,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:34,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:34,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2022-02-21 03:23:34,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:34,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 45 states and 56 transitions. [2022-02-21 03:23:34,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-02-21 03:23:34,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-02-21 03:23:34,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2022-02-21 03:23:34,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:34,649 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-02-21 03:23:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2022-02-21 03:23:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-21 03:23:34,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:34,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 56 transitions. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-21 03:23:34,652 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 56 transitions. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-21 03:23:34,652 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-21 03:23:34,653 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:34,658 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2022-02-21 03:23:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-02-21 03:23:34,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:34,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:34,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Second operand 45 states and 56 transitions. [2022-02-21 03:23:34,660 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Second operand 45 states and 56 transitions. [2022-02-21 03:23:34,660 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:34,666 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2022-02-21 03:23:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-02-21 03:23:34,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:34,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:34,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:34,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-21 03:23:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-02-21 03:23:34,669 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-02-21 03:23:34,670 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-02-21 03:23:34,670 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:34,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 56 transitions. [2022-02-21 03:23:34,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:34,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:34,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:34,671 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:34,671 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:34,672 INFO L791 eck$LassoCheckResult]: Stem: 708#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 705#L26 call main_#t~ret5#1 := g(main_~x~0#1);< 716#gENTRY ~x := #in~x; 704#L19 assume !(~x <= 0); 694#L20 call #t~ret2 := f(~x - 1);< 715#fENTRY ~x := #in~x; 726#L13 assume !(~x <= 0); 710#L14 call #t~ret0 := g(~x);< 711#gENTRY ~x := #in~x; 718#L19 assume !(~x <= 0); 691#L20 call #t~ret2 := f(~x - 1);< 714#fENTRY ~x := #in~x; 719#L13 assume ~x <= 0;#res := 0; 690#fFINAL assume true; 692#fEXIT >#31#return; 697#L20-1 call #t~ret3 := f(~x - 2);< 724#fENTRY ~x := #in~x; 734#L13 assume ~x <= 0;#res := 0; 733#fFINAL assume true; 732#fEXIT >#33#return; 725#L20-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 712#gFINAL assume true; 713#gEXIT >#27#return; 701#L14-1 [2022-02-21 03:23:34,672 INFO L793 eck$LassoCheckResult]: Loop: 701#L14-1 call #t~ret1 := g(1 + ~x);< 707#gENTRY ~x := #in~x; 700#L19 assume !(~x <= 0); 703#L20 call #t~ret2 := f(~x - 1);< 729#fENTRY ~x := #in~x; 727#L13 assume !(~x <= 0); 702#L14 call #t~ret0 := g(~x);< 707#gENTRY ~x := #in~x; 700#L19 assume !(~x <= 0); 703#L20 call #t~ret2 := f(~x - 1);< 729#fENTRY ~x := #in~x; 727#L13 assume ~x <= 0;#res := 0; 728#fFINAL assume true; 731#fEXIT >#31#return; 706#L20-1 call #t~ret3 := f(~x - 2);< 729#fENTRY ~x := #in~x; 727#L13 assume ~x <= 0;#res := 0; 728#fFINAL assume true; 731#fEXIT >#33#return; 725#L20-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 712#gFINAL assume true; 713#gEXIT >#27#return; 701#L14-1 [2022-02-21 03:23:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1263731607, now seen corresponding path program 1 times [2022-02-21 03:23:34,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:34,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803734503] [2022-02-21 03:23:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:34,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:34,690 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:34,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1714809691, now seen corresponding path program 1 times [2022-02-21 03:23:34,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:34,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722721781] [2022-02-21 03:23:34,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:34,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:34,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:34,707 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:34,708 INFO L85 PathProgramCache]: Analyzing trace with hash 790919793, now seen corresponding path program 1 times [2022-02-21 03:23:34,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:34,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481144817] [2022-02-21 03:23:34,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:34,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:34,723 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:34,736 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:35,736 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret5 := g(~x~0); [2022-02-21 03:23:35,743 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.NonterminatingLassoResult.getLongDescription(NonterminatingLassoResult.java:69) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.interpretAndReportResult(BuchiAutomizerObserver.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:23:35,746 INFO L158 Benchmark]: Toolchain (without parser) took 4283.45ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 95.6MB in the beginning and 77.0MB in the end (delta: 18.6MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2022-02-21 03:23:35,755 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:35,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.84ms. Allocated memory is still 123.7MB. Free memory was 95.3MB in the beginning and 98.3MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:23:35,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.68ms. Allocated memory is still 123.7MB. Free memory was 98.3MB in the beginning and 96.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:35,756 INFO L158 Benchmark]: Boogie Preprocessor took 16.51ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 95.9MB in the end (delta: 911.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:23:35,756 INFO L158 Benchmark]: RCFGBuilder took 329.05ms. Allocated memory is still 123.7MB. Free memory was 95.9MB in the beginning and 86.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:23:35,757 INFO L158 Benchmark]: BuchiAutomizer took 3678.69ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 86.4MB in the beginning and 78.1MB in the end (delta: 8.4MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2022-02-21 03:23:35,758 INFO L339 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 0.16ms. Allocated memory is still 123.7MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.84ms. Allocated memory is still 123.7MB. Free memory was 95.3MB in the beginning and 98.3MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.68ms. Allocated memory is still 123.7MB. Free memory was 98.3MB in the beginning and 96.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.51ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 95.9MB in the end (delta: 911.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 329.05ms. Allocated memory is still 123.7MB. Free memory was 95.9MB in the beginning and 86.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3678.69ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 86.4MB in the beginning and 78.1MB in the end (delta: 8.4MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(x) and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 45 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 3 iterations. TraceHistogramMax:3. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 28 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf100 smp100 tf112 neg94 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 14]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4649c8d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d17a659=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23a8e1d1=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@395081c2=0, \result=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21d9368d=0, \old(x)=1, x=1, x=0, \result=0, \old(x)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74e69f8a=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:23:35,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator