./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:35:23,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:35:23,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:35:23,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:35:23,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:35:23,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:35:23,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:35:23,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:35:23,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:35:23,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:35:23,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:35:23,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:35:23,647 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:35:23,648 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:35:23,648 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:35:23,648 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:35:23,648 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:35:23,649 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:35:23,649 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:35:23,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:35:23,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:35:23,650 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:35:23,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:35:23,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:35:23,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:35:23,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:35:23,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:35:23,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:35:23,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:35:23,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:35:23,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:35:23,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:35:23,653 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:35:23,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:35:23,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:35:23,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:35:23,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:35:23,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:35:23,655 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:35:23,655 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c [2024-10-25 00:35:23,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:35:23,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:35:23,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:35:23,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:35:23,852 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:35:23,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2024-10-25 00:35:25,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:35:25,274 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:35:25,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2024-10-25 00:35:25,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa2a63c36/3fea557f2d654722b8cd9d322a7c69fa/FLAG0a0c28163 [2024-10-25 00:35:25,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa2a63c36/3fea557f2d654722b8cd9d322a7c69fa [2024-10-25 00:35:25,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:35:25,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:35:25,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:35:25,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:35:25,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:35:25,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ed2cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25, skipping insertion in model container [2024-10-25 00:35:25,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:35:25,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:35:25,449 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:35:25,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:35:25,474 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:35:25,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25 WrapperNode [2024-10-25 00:35:25,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:35:25,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:35:25,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:35:25,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:35:25,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,497 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-10-25 00:35:25,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:35:25,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:35:25,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:35:25,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:35:25,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,545 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-25 00:35:25,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:35:25,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:35:25,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:35:25,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:35:25,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (1/1) ... [2024-10-25 00:35:25,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:25,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:25,592 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) [2024-10-25 00:35:25,595 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 [2024-10-25 00:35:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:35:25,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:35:25,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:35:25,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:35:25,630 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2024-10-25 00:35:25,630 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2024-10-25 00:35:25,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:35:25,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:35:25,782 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-25 00:35:25,783 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:35:25,791 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:35:25,791 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-25 00:35:25,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:35:25 BoogieIcfgContainer [2024-10-25 00:35:25,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:35:25,792 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:35:25,793 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:35:25,795 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:35:25,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:35:25,796 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:35:25" (1/3) ... [2024-10-25 00:35:25,797 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a07ed35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:35:25, skipping insertion in model container [2024-10-25 00:35:25,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:35:25,797 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:35:25" (2/3) ... [2024-10-25 00:35:25,797 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a07ed35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:35:25, skipping insertion in model container [2024-10-25 00:35:25,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:35:25,797 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:35:25" (3/3) ... [2024-10-25 00:35:25,798 INFO L332 chiAutomizerObserver]: Analyzing ICFG McCarthy91-2.c [2024-10-25 00:35:25,836 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:35:25,836 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:35:25,837 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:35:25,837 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:35:25,837 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:35:25,837 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:35:25,837 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:35:25,837 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:35:25,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-25 00:35:25,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:35:25,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:25,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:25,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:35:25,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:35:25,858 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:35:25,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-25 00:35:25,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:35:25,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:25,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:25,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:35:25,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:35:25,866 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 14#L28true call main_#t~ret7#1 := f91(main_~x~0#1);< 12#$Ultimate##0true [2024-10-25 00:35:25,866 INFO L747 eck$LassoCheckResult]: Loop: 12#$Ultimate##0true ~x := #in~x; 8#L18true assume !(~x > 100); 10#L21true call #t~ret4 := f91(11 + ~x);< 12#$Ultimate##0true [2024-10-25 00:35:25,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 29879, now seen corresponding path program 1 times [2024-10-25 00:35:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:25,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432593244] [2024-10-25 00:35:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:25,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:25,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:25,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:25,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash 46807, now seen corresponding path program 1 times [2024-10-25 00:35:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:25,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072466658] [2024-10-25 00:35:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:25,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:25,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:25,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash 890142305, now seen corresponding path program 1 times [2024-10-25 00:35:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:25,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176379238] [2024-10-25 00:35:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:25,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:25,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:26,056 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:26,056 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:26,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:26,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:26,057 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:26,057 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,057 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:26,057 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:26,057 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration1_Loop [2024-10-25 00:35:26,057 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:26,057 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:26,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,128 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:26,129 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:26,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,135 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) [2024-10-25 00:35:26,137 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 [2024-10-25 00:35:26,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:26,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:26,155 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:26,155 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:26,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-25 00:35:26,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,168 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) [2024-10-25 00:35:26,170 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 [2024-10-25 00:35:26,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:26,171 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:26,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-25 00:35:26,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,195 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) [2024-10-25 00:35:26,196 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 [2024-10-25 00:35:26,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:26,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:26,554 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:35:26,560 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 [2024-10-25 00:35:26,560 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:26,560 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:26,560 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:26,561 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:26,561 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:26,561 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,561 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:26,561 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:26,561 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration1_Loop [2024-10-25 00:35:26,561 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:26,561 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:26,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:26,648 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:26,656 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:26,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,666 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) [2024-10-25 00:35:26,667 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 [2024-10-25 00:35:26,669 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 [2024-10-25 00:35:26,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:26,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:26,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:26,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:26,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:26,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:26,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:26,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:26,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-25 00:35:26,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,702 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) [2024-10-25 00:35:26,703 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 [2024-10-25 00:35:26,705 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 [2024-10-25 00:35:26,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:26,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:26,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:26,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:26,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:26,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:26,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:26,723 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:26,727 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:35:26,727 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:35:26,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:26,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:26,749 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) [2024-10-25 00:35:26,750 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 [2024-10-25 00:35:26,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:26,751 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:26,751 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:26,752 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 Supporting invariants [] [2024-10-25 00:35:26,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-25 00:35:26,766 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:26,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:26,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:35:26,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:26,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:26,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:26,906 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-25 00:35:26,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:35:26,960 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 [2024-10-25 00:35:27,064 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 43 transitions. Complement of second has 16 states. [2024-10-25 00:35:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:35:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2024-10-25 00:35:27,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2024-10-25 00:35:27,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:27,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2024-10-25 00:35:27,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:27,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2024-10-25 00:35:27,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:27,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-10-25 00:35:27,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:35:27,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 19 states and 25 transitions. [2024-10-25 00:35:27,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-25 00:35:27,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-25 00:35:27,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2024-10-25 00:35:27,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:27,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-10-25 00:35:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2024-10-25 00:35:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-25 00:35:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-25 00:35:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-25 00:35:27,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-25 00:35:27,110 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-25 00:35:27,110 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:35:27,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-25 00:35:27,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:35:27,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:27,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:27,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:35:27,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-25 00:35:27,113 INFO L745 eck$LassoCheckResult]: Stem: 119#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 113#L28 call main_#t~ret7#1 := f91(main_~x~0#1);< 112#$Ultimate##0 ~x := #in~x; 114#L18 assume !(~x > 100); 110#L21 call #t~ret4 := f91(11 + ~x);< 115#$Ultimate##0 ~x := #in~x; 116#L18 assume ~x > 100;#res := ~x - 10; 123#f91FINAL assume true; 109#f91EXIT >#29#return; 111#L21-1 [2024-10-25 00:35:27,113 INFO L747 eck$LassoCheckResult]: Loop: 111#L21-1 call #t~ret5 := f91(#t~ret4);< 118#$Ultimate##0 ~x := #in~x; 125#L18 assume !(~x > 100); 117#L21 call #t~ret4 := f91(11 + ~x);< 118#$Ultimate##0 ~x := #in~x; 125#L18 assume ~x > 100;#res := ~x - 10; 122#f91FINAL assume true; 124#f91EXIT >#29#return; 111#L21-1 [2024-10-25 00:35:27,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash -218206616, now seen corresponding path program 1 times [2024-10-25 00:35:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061795006] [2024-10-25 00:35:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1767505954, now seen corresponding path program 1 times [2024-10-25 00:35:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623617256] [2024-10-25 00:35:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:27,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:27,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1919740023, now seen corresponding path program 1 times [2024-10-25 00:35:27,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:27,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113443113] [2024-10-25 00:35:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:27,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:27,294 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:27,294 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:27,294 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:27,294 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:27,294 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:27,294 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:27,294 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:27,294 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:27,294 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration2_Loop [2024-10-25 00:35:27,295 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:27,295 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:27,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:27,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:27,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:27,333 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:27,334 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:27,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:27,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:27,335 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) [2024-10-25 00:35:27,336 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 [2024-10-25 00:35:27,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:27,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:27,352 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:27,353 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret5=0} Honda state: {f91_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:27,363 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 [2024-10-25 00:35:27,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:27,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:27,365 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) [2024-10-25 00:35:27,366 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 [2024-10-25 00:35:27,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:27,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:27,382 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:27,382 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:27,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-25 00:35:27,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:27,396 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) [2024-10-25 00:35:27,397 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 [2024-10-25 00:35:27,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:27,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:27,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-25 00:35:27,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:27,436 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) [2024-10-25 00:35:27,438 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 [2024-10-25 00:35:27,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:27,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:39,482 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-25 00:35:39,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-25 00:35:39,493 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:39,493 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:39,493 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:39,493 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:39,494 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:39,494 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,494 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:39,494 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:39,494 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration2_Loop [2024-10-25 00:35:39,495 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:39,495 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:39,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:39,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:39,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:39,540 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:39,540 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:39,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:39,542 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) [2024-10-25 00:35:39,543 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 [2024-10-25 00:35:39,546 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 [2024-10-25 00:35:39,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:39,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:39,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:39,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:39,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:39,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:39,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:39,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:39,569 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 [2024-10-25 00:35:39,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:39,571 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) [2024-10-25 00:35:39,580 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 [2024-10-25 00:35:39,580 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 [2024-10-25 00:35:39,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:39,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:39,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:39,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:39,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:39,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:39,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:39,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:39,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-25 00:35:39,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:39,606 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) [2024-10-25 00:35:39,607 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 [2024-10-25 00:35:39,608 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 [2024-10-25 00:35:39,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:39,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:39,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:39,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:39,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:39,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:39,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:39,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:39,625 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:35:39,625 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:35:39,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:39,627 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) [2024-10-25 00:35:39,630 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 [2024-10-25 00:35:39,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:39,631 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:39,631 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:39,631 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret4) = -2*f91_#t~ret4 + 201 Supporting invariants [] [2024-10-25 00:35:39,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-25 00:35:39,644 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:39,650 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret4 [2024-10-25 00:35:39,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:39,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:35:39,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:39,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-25 00:35:39,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:39,904 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-25 00:35:39,904 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-25 00:35:40,100 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 51 states and 73 transitions. Complement of second has 32 states. [2024-10-25 00:35:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-25 00:35:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-25 00:35:40,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-25 00:35:40,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:40,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2024-10-25 00:35:40,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:40,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2024-10-25 00:35:40,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:40,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2024-10-25 00:35:40,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-25 00:35:40,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 62 transitions. [2024-10-25 00:35:40,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-25 00:35:40,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-10-25 00:35:40,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2024-10-25 00:35:40,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:40,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-25 00:35:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2024-10-25 00:35:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-25 00:35:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-25 00:35:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2024-10-25 00:35:40,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-25 00:35:40,112 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-25 00:35:40,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:35:40,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2024-10-25 00:35:40,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-25 00:35:40,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:40,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:40,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:35:40,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:35:40,114 INFO L745 eck$LassoCheckResult]: Stem: 316#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 311#L28 call main_#t~ret7#1 := f91(main_~x~0#1);< 315#$Ultimate##0 ~x := #in~x; 321#L18 assume !(~x > 100); 306#L21 call #t~ret4 := f91(11 + ~x);< 304#$Ultimate##0 ~x := #in~x; 308#L18 assume ~x > 100;#res := ~x - 10; 326#f91FINAL assume true; 325#f91EXIT >#29#return; 296#L21-1 call #t~ret5 := f91(#t~ret4);< 313#$Ultimate##0 ~x := #in~x; 328#L18 assume !(~x > 100); 302#L21 [2024-10-25 00:35:40,114 INFO L747 eck$LassoCheckResult]: Loop: 302#L21 call #t~ret4 := f91(11 + ~x);< 301#$Ultimate##0 ~x := #in~x; 303#L18 assume !(~x > 100); 302#L21 [2024-10-25 00:35:40,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1987218266, now seen corresponding path program 2 times [2024-10-25 00:35:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:40,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491491078] [2024-10-25 00:35:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:40,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:40,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:40,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash 57247, now seen corresponding path program 2 times [2024-10-25 00:35:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:40,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912652539] [2024-10-25 00:35:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:40,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:40,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:40,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -609818202, now seen corresponding path program 3 times [2024-10-25 00:35:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310208681] [2024-10-25 00:35:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-25 00:35:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 00:35:40,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:40,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310208681] [2024-10-25 00:35:40,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310208681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:35:40,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:35:40,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-25 00:35:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626231822] [2024-10-25 00:35:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:35:40,434 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:40,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:40,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:40,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:40,434 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:40,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:40,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:40,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:40,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration3_Loop [2024-10-25 00:35:40,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:40,434 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:40,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:40,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:40,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:40,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:40,490 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:40,491 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:40,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:40,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:40,495 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) [2024-10-25 00:35:40,497 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 [2024-10-25 00:35:40,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:40,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:40,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:40,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:40,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:40,531 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) [2024-10-25 00:35:40,534 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 [2024-10-25 00:35:40,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:40,534 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:52,684 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-25 00:35:52,698 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 [2024-10-25 00:35:52,698 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:52,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:52,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:52,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:52,699 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:52,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:52,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:52,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:52,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration3_Loop [2024-10-25 00:35:52,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:52,699 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:52,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:52,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:52,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:52,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:52,731 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:52,731 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:52,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:52,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:52,733 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-10-25 00:35:52,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-25 00:35:52,738 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 [2024-10-25 00:35:52,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:52,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:52,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:52,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:52,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:52,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:52,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:52,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:35:52,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:52,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:52,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:52,762 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-10-25 00:35:52,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-25 00:35:52,763 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 [2024-10-25 00:35:52,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:52,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:52,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:52,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:52,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:52,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:52,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:52,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:52,787 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:35:52,787 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:35:52,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:52,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:52,789 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-10-25 00:35:52,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-25 00:35:52,812 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:52,812 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:52,812 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:52,812 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_~x) = -2*f91_~x + 189 Supporting invariants [] [2024-10-25 00:35:52,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-25 00:35:52,831 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:52,832 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 [2024-10-25 00:35:52,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:52,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-25 00:35:52,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:52,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:52,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:53,005 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-25 00:35:53,005 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:35:53,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2024-10-25 00:35:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:35:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-10-25 00:35:53,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-25 00:35:53,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:53,071 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:53,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-25 00:35:53,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:53,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:53,191 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-25 00:35:53,191 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:35:53,247 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2024-10-25 00:35:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:35:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-10-25 00:35:53,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-25 00:35:53,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:53,250 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-25 00:35:53,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:35:53,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:35:53,358 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-25 00:35:53,358 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:35:53,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 71 states and 100 transitions. Complement of second has 16 states. [2024-10-25 00:35:53,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:35:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2024-10-25 00:35:53,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-25 00:35:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2024-10-25 00:35:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2024-10-25 00:35:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:53,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 100 transitions. [2024-10-25 00:35:53,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-25 00:35:53,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 74 transitions. [2024-10-25 00:35:53,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-25 00:35:53,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-25 00:35:53,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2024-10-25 00:35:53,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:53,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-10-25 00:35:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2024-10-25 00:35:53,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2024-10-25 00:35:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (18), 9 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-25 00:35:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2024-10-25 00:35:53,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2024-10-25 00:35:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:35:53,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-25 00:35:53,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-25 00:35:53,478 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:35:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:35:53,558 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-10-25 00:35:53,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2024-10-25 00:35:53,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-25 00:35:53,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 58 states and 75 transitions. [2024-10-25 00:35:53,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:35:53,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:35:53,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 75 transitions. [2024-10-25 00:35:53,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:53,562 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-10-25 00:35:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 75 transitions. [2024-10-25 00:35:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-10-25 00:35:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 13 states have call successors, (18), 11 states have call predecessors, (18), 9 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-25 00:35:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-10-25 00:35:53,566 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-10-25 00:35:53,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-25 00:35:53,569 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-10-25 00:35:53,569 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:35:53,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 74 transitions. [2024-10-25 00:35:53,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-25 00:35:53,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:53,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:53,571 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-25 00:35:53,571 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2024-10-25 00:35:53,571 INFO L745 eck$LassoCheckResult]: Stem: 853#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 849#L28 call main_#t~ret7#1 := f91(main_~x~0#1);< 852#$Ultimate##0 ~x := #in~x; 876#L18 assume !(~x > 100); 869#L21 call #t~ret4 := f91(11 + ~x);< 871#$Ultimate##0 ~x := #in~x; 873#L18 assume !(~x > 100); 868#L21 call #t~ret4 := f91(11 + ~x);< 872#$Ultimate##0 ~x := #in~x; 875#L18 assume ~x > 100;#res := ~x - 10; 874#f91FINAL assume true; 870#f91EXIT >#29#return; 843#L21-1 call #t~ret5 := f91(#t~ret4);< 842#$Ultimate##0 ~x := #in~x; 844#L18 assume ~x > 100;#res := ~x - 10; 861#f91FINAL assume true; 891#f91EXIT >#31#return; 838#L21-2 #res := #t~ret5;havoc #t~ret4;havoc #t~ret5; 888#f91FINAL assume true; 887#f91EXIT >#29#return; 836#L21-1 call #t~ret5 := f91(#t~ret4);< 850#$Ultimate##0 [2024-10-25 00:35:53,571 INFO L747 eck$LassoCheckResult]: Loop: 850#$Ultimate##0 ~x := #in~x; 879#L18 assume !(~x > 100); 847#L21 call #t~ret4 := f91(11 + ~x);< 845#$Ultimate##0 ~x := #in~x; 848#L18 assume !(~x > 100); 846#L21 call #t~ret4 := f91(11 + ~x);< 864#$Ultimate##0 ~x := #in~x; 885#L18 assume ~x > 100;#res := ~x - 10; 883#f91FINAL assume true; 881#f91EXIT >#29#return; 857#L21-1 call #t~ret5 := f91(#t~ret4);< 880#$Ultimate##0 ~x := #in~x; 877#L18 assume ~x > 100;#res := ~x - 10; 878#f91FINAL assume true; 889#f91EXIT >#31#return; 838#L21-2 #res := #t~ret5;havoc #t~ret4;havoc #t~ret5; 888#f91FINAL assume true; 887#f91EXIT >#29#return; 837#L21-1 call #t~ret5 := f91(#t~ret4);< 850#$Ultimate##0 [2024-10-25 00:35:53,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash -834951989, now seen corresponding path program 1 times [2024-10-25 00:35:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:53,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132220542] [2024-10-25 00:35:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:53,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:53,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:53,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:53,591 INFO L85 PathProgramCache]: Analyzing trace with hash -871747263, now seen corresponding path program 1 times [2024-10-25 00:35:53,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:53,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281855519] [2024-10-25 00:35:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:53,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:53,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:53,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash 418853943, now seen corresponding path program 2 times [2024-10-25 00:35:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:53,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360505772] [2024-10-25 00:35:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-25 00:35:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:35:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-25 00:35:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-25 00:35:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:35:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-25 00:35:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 00:35:53,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:53,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360505772] [2024-10-25 00:35:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360505772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:35:53,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324363226] [2024-10-25 00:35:53,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:35:53,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:35:53,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:53,768 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:35:53,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-25 00:35:53,802 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:35:53,802 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:35:53,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-25 00:35:53,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 00:35:53,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:35:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 00:35:54,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324363226] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:35:54,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:35:54,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2024-10-25 00:35:54,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733128039] [2024-10-25 00:35:54,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:35:54,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:54,244 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:54,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:54,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:54,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:54,244 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:54,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:54,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:54,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:54,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration4_Loop [2024-10-25 00:35:54,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:54,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:54,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,279 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:54,279 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:54,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:54,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:54,281 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2024-10-25 00:35:54,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-25 00:35:54,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:54,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:54,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-25 00:35:54,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:54,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:54,316 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2024-10-25 00:35:54,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-25 00:35:54,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:54,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:54,331 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:35:54,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-25 00:35:54,345 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:54,345 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:54,345 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:54,345 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:54,345 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:35:54,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:54,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:54,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:54,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration4_Loop [2024-10-25 00:35:54,346 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:54,346 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:54,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:54,379 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:54,379 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:35:54,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:54,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:54,381 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2024-10-25 00:35:54,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-25 00:35:54,383 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 [2024-10-25 00:35:54,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:35:54,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:35:54,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:35:54,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:35:54,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:35:54,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:35:54,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:35:54,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:35:54,397 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:35:54,397 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:35:54,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:54,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:54,399 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2024-10-25 00:35:54,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-25 00:35:54,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:35:54,400 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:35:54,400 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:35:54,400 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -1*f91_#in~x + 90 Supporting invariants [] [2024-10-25 00:35:54,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:54,412 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:35:54,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:54,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-25 00:35:54,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:54,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-25 00:35:54,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-25 00:35:54,827 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-25 00:35:54,827 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:55,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 49 states. [2024-10-25 00:35:55,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2024-10-25 00:35:55,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-25 00:35:55,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:55,245 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:55,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:55,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-25 00:35:55,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:55,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-25 00:35:55,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:55,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-25 00:35:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:35:55,550 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2024-10-25 00:35:55,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-25 00:35:55,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 39 states. [2024-10-25 00:35:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-25 00:35:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2024-10-25 00:35:55,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-25 00:35:55,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:55,841 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:35:55,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:55,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-25 00:35:55,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:56,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-25 00:35:56,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-25 00:35:56,151 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-25 00:35:56,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:56,660 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 431 states and 531 transitions. Complement of second has 224 states. [2024-10-25 00:35:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 18 non-accepting loop states 1 accepting loop states [2024-10-25 00:35:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-25 00:35:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2024-10-25 00:35:56,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-25 00:35:56,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:56,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 41 letters. Loop has 19 letters. [2024-10-25 00:35:56,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:56,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 22 letters. Loop has 38 letters. [2024-10-25 00:35:56,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:35:56,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 531 transitions. [2024-10-25 00:35:56,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2024-10-25 00:35:56,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 203 states and 269 transitions. [2024-10-25 00:35:56,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-25 00:35:56,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2024-10-25 00:35:56,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 269 transitions. [2024-10-25 00:35:56,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:56,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 203 states and 269 transitions. [2024-10-25 00:35:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 269 transitions. [2024-10-25 00:35:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 157. [2024-10-25 00:35:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 97 states have (on average 1.092783505154639) internal successors, (106), 99 states have internal predecessors, (106), 35 states have call successors, (45), 29 states have call predecessors, (45), 25 states have return successors, (47), 28 states have call predecessors, (47), 32 states have call successors, (47) [2024-10-25 00:35:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2024-10-25 00:35:56,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 198 transitions. [2024-10-25 00:35:56,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:35:56,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-25 00:35:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-25 00:35:56,708 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-25 00:35:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:35:56,855 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2024-10-25 00:35:56,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 188 transitions. [2024-10-25 00:35:56,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:35:56,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 104 states and 123 transitions. [2024-10-25 00:35:56,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-10-25 00:35:56,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-10-25 00:35:56,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 123 transitions. [2024-10-25 00:35:56,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:35:56,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-10-25 00:35:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 123 transitions. [2024-10-25 00:35:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-10-25 00:35:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 64 states have internal predecessors, (66), 21 states have call successors, (28), 20 states have call predecessors, (28), 16 states have return successors, (25), 15 states have call predecessors, (25), 18 states have call successors, (25) [2024-10-25 00:35:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-10-25 00:35:56,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-10-25 00:35:56,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-25 00:35:56,872 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-10-25 00:35:56,872 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:35:56,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 119 transitions. [2024-10-25 00:35:56,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:35:56,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:35:56,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:35:56,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2024-10-25 00:35:56,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-25 00:35:56,877 INFO L745 eck$LassoCheckResult]: Stem: 3022#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 3023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 3020#L28 call main_#t~ret7#1 := f91(main_~x~0#1);< 3021#$Ultimate##0 ~x := #in~x; 3033#L18 assume !(~x > 100); 3034#L21 call #t~ret4 := f91(11 + ~x);< 3037#$Ultimate##0 ~x := #in~x; 3050#L18 assume !(~x > 100); 3044#L21 call #t~ret4 := f91(11 + ~x);< 3048#$Ultimate##0 ~x := #in~x; 3051#L18 assume ~x > 100;#res := ~x - 10; 3049#f91FINAL assume true; 3047#f91EXIT >#29#return; 3043#L21-1 call #t~ret5 := f91(#t~ret4);< 3045#$Ultimate##0 ~x := #in~x; 3077#L18 assume ~x > 100;#res := ~x - 10; 3064#f91FINAL assume true; 3063#f91EXIT >#31#return; 3061#L21-2 #res := #t~ret5;havoc #t~ret4;havoc #t~ret5; 3060#f91FINAL assume true; 3059#f91EXIT >#29#return; 3052#L21-1 call #t~ret5 := f91(#t~ret4);< 3058#$Ultimate##0 ~x := #in~x; 3056#L18 assume !(~x > 100); 3015#L21 call #t~ret4 := f91(11 + ~x);< 3014#$Ultimate##0 ~x := #in~x; 3016#L18 assume !(~x > 100); 3004#L21 call #t~ret4 := f91(11 + ~x);< 3055#$Ultimate##0 ~x := #in~x; 3102#L18 assume ~x > 100;#res := ~x - 10; 3101#f91FINAL assume true; 3003#f91EXIT >#29#return; 3005#L21-1 [2024-10-25 00:35:56,877 INFO L747 eck$LassoCheckResult]: Loop: 3005#L21-1 call #t~ret5 := f91(#t~ret4);< 3017#$Ultimate##0 ~x := #in~x; 3099#L18 assume !(~x > 100); 3035#L21 call #t~ret4 := f91(11 + ~x);< 3036#$Ultimate##0 ~x := #in~x; 3097#L18 assume ~x > 100;#res := ~x - 10; 3096#f91FINAL assume true; 3095#f91EXIT >#29#return; 3005#L21-1 [2024-10-25 00:35:56,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2083076242, now seen corresponding path program 3 times [2024-10-25 00:35:56,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:56,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449530430] [2024-10-25 00:35:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-25 00:35:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:35:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-25 00:35:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-25 00:35:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:35:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-25 00:35:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:35:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449530430] [2024-10-25 00:35:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449530430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:35:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622971208] [2024-10-25 00:35:57,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:35:57,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:35:57,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:57,027 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:35:57,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-25 00:35:57,058 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-25 00:35:57,059 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:35:57,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-25 00:35:57,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:35:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 00:35:57,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-25 00:35:57,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622971208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:35:57,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-25 00:35:57,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2024-10-25 00:35:57,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319633327] [2024-10-25 00:35:57,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:35:57,080 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:35:57,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:35:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1767505954, now seen corresponding path program 2 times [2024-10-25 00:35:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:35:57,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742338515] [2024-10-25 00:35:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:35:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:35:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:57,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:35:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:35:57,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:35:57,175 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:35:57,175 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:35:57,175 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:35:57,175 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:35:57,175 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:35:57,175 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:57,175 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:35:57,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:35:57,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration5_Loop [2024-10-25 00:35:57,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:35:57,176 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:35:57,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:57,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:57,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:35:57,236 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:35:57,236 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:35:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:57,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:57,238 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2024-10-25 00:35:57,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-25 00:35:57,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:57,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:57,251 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:35:57,251 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:35:57,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-25 00:35:57,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:57,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:57,266 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2024-10-25 00:35:57,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-25 00:35:57,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:35:57,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:35:57,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-25 00:35:57,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:35:57,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:35:57,301 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2024-10-25 00:35:57,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-25 00:35:57,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:35:57,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:36:09,344 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-25 00:36:09,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-25 00:36:09,355 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:36:09,355 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:36:09,355 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:36:09,355 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:36:09,355 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:36:09,355 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:36:09,355 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:36:09,355 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:36:09,355 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration5_Loop [2024-10-25 00:36:09,355 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:36:09,355 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:36:09,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:36:09,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:36:09,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:36:09,393 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:36:09,394 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:36:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:36:09,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:36:09,397 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2024-10-25 00:36:09,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-25 00:36:09,403 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 [2024-10-25 00:36:09,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:36:09,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:36:09,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:36:09,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:36:09,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:36:09,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:36:09,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:36:09,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:36:09,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-25 00:36:09,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:36:09,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:36:09,438 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2024-10-25 00:36:09,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-25 00:36:09,440 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 [2024-10-25 00:36:09,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:36:09,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:36:09,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:36:09,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:36:09,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:36:09,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:36:09,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:36:09,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:36:09,456 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:36:09,456 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:36:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:36:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:36:09,458 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2024-10-25 00:36:09,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-25 00:36:09,459 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:36:09,459 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:36:09,460 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:36:09,460 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret4) = -2*f91_#t~ret4 + 201 Supporting invariants [] [2024-10-25 00:36:09,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-25 00:36:09,471 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:36:09,472 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret4 [2024-10-25 00:36:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:36:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:36:09,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-25 00:36:09,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:36:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:36:09,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-25 00:36:09,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:36:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:36:09,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-25 00:36:09,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-25 00:36:09,808 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 139 states and 161 transitions. Complement of second has 24 states. [2024-10-25 00:36:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-25 00:36:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-25 00:36:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-25 00:36:09,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-25 00:36:09,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:36:09,809 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:36:09,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:36:09,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-25 00:36:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:36:09,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-25 00:36:09,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:36:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:36:10,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-25 00:36:10,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:36:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:36:10,071 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-25 00:36:10,071 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-25 00:36:10,181 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 139 states and 161 transitions. Complement of second has 24 states. [2024-10-25 00:36:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-25 00:36:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-25 00:36:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-25 00:36:10,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-25 00:36:10,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:36:10,182 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:36:10,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:36:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:36:10,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-25 00:36:10,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:36:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:36:10,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-25 00:36:10,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:36:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:36:10,420 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-25 00:36:10,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-25 00:36:10,538 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 181 states and 211 transitions. Complement of second has 27 states. [2024-10-25 00:36:10,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-25 00:36:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-25 00:36:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2024-10-25 00:36:10,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-25 00:36:10,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:36:10,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 40 letters. Loop has 8 letters. [2024-10-25 00:36:10,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:36:10,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 32 letters. Loop has 16 letters. [2024-10-25 00:36:10,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:36:10,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 211 transitions. [2024-10-25 00:36:10,545 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:36:10,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 0 states and 0 transitions. [2024-10-25 00:36:10,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:36:10,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:36:10,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:36:10,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:36:10,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:36:10,545 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:36:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:36:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-25 00:36:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-25 00:36:10,546 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 5 states have internal predecessors, (16), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-25 00:36:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:36:10,546 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-25 00:36:10,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-25 00:36:10,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:36:10,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-25 00:36:10,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:36:10,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:36:10,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:36:10,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:36:10,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:36:10,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:36:10,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 00:36:10,546 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:36:10,546 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:36:10,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-25 00:36:10,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:36:10,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-25 00:36:10,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.10 12:36:10 BoogieIcfgContainer [2024-10-25 00:36:10,553 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-25 00:36:10,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-25 00:36:10,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-25 00:36:10,554 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-25 00:36:10,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:35:25" (3/4) ... [2024-10-25 00:36:10,555 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-25 00:36:10,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-25 00:36:10,558 INFO L158 Benchmark]: Toolchain (without parser) took 45260.66ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 97.0MB in the beginning and 85.6MB in the end (delta: 11.4MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-10-25 00:36:10,558 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:36:10,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.31ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 85.2MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-25 00:36:10,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.03ms. Allocated memory is still 167.8MB. Free memory was 85.2MB in the beginning and 83.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:36:10,558 INFO L158 Benchmark]: Boogie Preprocessor took 56.91ms. Allocated memory is still 167.8MB. Free memory was 83.8MB in the beginning and 137.2MB in the end (delta: -53.4MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-25 00:36:10,559 INFO L158 Benchmark]: RCFGBuilder took 236.02ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 137.1MB in the beginning and 183.9MB in the end (delta: -46.8MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-10-25 00:36:10,559 INFO L158 Benchmark]: BuchiAutomizer took 44760.92ms. Allocated memory is still 218.1MB. Free memory was 182.8MB in the beginning and 85.6MB in the end (delta: 97.2MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2024-10-25 00:36:10,559 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 218.1MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:36:10,560 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.31ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 85.2MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.03ms. Allocated memory is still 167.8MB. Free memory was 85.2MB in the beginning and 83.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.91ms. Allocated memory is still 167.8MB. Free memory was 83.8MB in the beginning and 137.2MB in the end (delta: -53.4MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * RCFGBuilder took 236.02ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 137.1MB in the beginning and 183.9MB in the end (delta: -46.8MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 44760.92ms. Allocated memory is still 218.1MB. Free memory was 182.8MB in the beginning and 85.6MB in the end (delta: 97.2MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 218.1MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function (211 + ((long long) -2 * \old(x))) and consists of 5 locations. One deterministic module has affine ranking function null and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -2 * x) + 189) and consists of 6 locations. One nondeterministic module has affine ranking function (((long long) -1 * \old(x)) + 90) and consists of 21 locations. One nondeterministic module has affine ranking function null and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.7s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 39.6s. Construction of modules took 0.5s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/24 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 821 IncrementalHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 170 mSDtfsCounter, 821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 36.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-25 00:36:10,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-10-25 00:36:10,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-25 00:36:10,984 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 Writing output log to file Ultimate.log Result: TRUE