./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Parts.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Parts.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:01:41,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:01:41,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:01:41,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:01:41,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:01:41,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:01:41,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:01:41,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:01:41,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:01:41,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:01:41,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:01:41,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:01:41,989 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:01:41,989 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:01:41,989 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:01:41,989 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:01:41,989 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:01:41,989 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:01:41,989 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:01:41,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:01:41,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:01:41,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:01:41,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:01:41,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:01:41,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:01:41,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:01:41,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:01:41,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:01:41,991 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:01:41,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:01:41,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:01:41,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:01:41,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:01:41,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:01:41,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:01:41,992 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:01:41,992 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 [2025-01-10 07:01:42,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:01:42,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:01:42,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:01:42,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:01:42,194 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:01:42,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Parts.c [2025-01-10 07:01:43,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15f20853b/e9fa75acb99f4f89b2c03b3cb91825c2/FLAG67776a30b [2025-01-10 07:01:43,673 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:01:43,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2025-01-10 07:01:43,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15f20853b/e9fa75acb99f4f89b2c03b3cb91825c2/FLAG67776a30b [2025-01-10 07:01:44,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15f20853b/e9fa75acb99f4f89b2c03b3cb91825c2 [2025-01-10 07:01:44,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:01:44,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:01:44,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:01:44,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:01:44,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:01:44,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f2c5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44, skipping insertion in model container [2025-01-10 07:01:44,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:01:44,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:01:44,185 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:01:44,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:01:44,204 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:01:44,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44 WrapperNode [2025-01-10 07:01:44,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:01:44,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:01:44,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:01:44,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:01:44,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,221 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-01-10 07:01:44,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:01:44,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:01:44,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:01:44,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:01:44,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,231 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:01:44,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:01:44,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:01:44,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:01:44,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:01:44,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (1/1) ... [2025-01-10 07:01:44,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:44,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:44,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:44,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:01:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2025-01-10 07:01:44,279 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2025-01-10 07:01:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:01:44,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:01:44,312 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:01:44,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:01:44,398 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-10 07:01:44,399 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:01:44,404 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:01:44,404 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:01:44,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:01:44 BoogieIcfgContainer [2025-01-10 07:01:44,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:01:44,405 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:01:44,405 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:01:44,409 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:01:44,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:44,409 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:01:44" (1/3) ... [2025-01-10 07:01:44,410 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b1622e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:01:44, skipping insertion in model container [2025-01-10 07:01:44,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:44,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:44" (2/3) ... [2025-01-10 07:01:44,410 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b1622e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:01:44, skipping insertion in model container [2025-01-10 07:01:44,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:44,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:01:44" (3/3) ... [2025-01-10 07:01:44,411 INFO L363 chiAutomizerObserver]: Analyzing ICFG Parts.c [2025-01-10 07:01:44,441 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:01:44,442 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:01:44,442 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:01:44,442 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:01:44,442 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:01:44,442 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:01:44,442 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:01:44,442 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:01:44,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 07:01:44,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:01:44,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:44,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:44,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:01:44,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:01:44,460 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:01:44,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 07:01:44,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:01:44,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:44,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:44,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:01:44,462 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:01:44,466 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" [2025-01-10 07:01:44,466 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2025-01-10 07:01:44,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 1 times [2025-01-10 07:01:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:44,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732972654] [2025-01-10 07:01:44,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:44,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:44,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:44,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:44,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:44,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:44,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:44,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:44,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:44,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:44,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:44,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2089, now seen corresponding path program 1 times [2025-01-10 07:01:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622801352] [2025-01-10 07:01:44,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:44,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:44,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:44,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:44,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:44,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:44,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:44,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:44,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:44,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:44,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:44,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1451656976, now seen corresponding path program 1 times [2025-01-10 07:01:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:44,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102610278] [2025-01-10 07:01:44,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:44,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:01:44,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:01:44,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:44,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:44,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:44,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102610278] [2025-01-10 07:01:44,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102610278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:44,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:44,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:01:44,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997575961] [2025-01-10 07:01:44,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:44,664 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:44,665 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:44,665 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:44,665 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:44,665 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:44,665 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:44,665 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:44,665 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:44,665 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-01-10 07:01:44,666 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:44,666 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:44,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:44,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:44,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:44,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:44,741 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:44,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:44,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:44,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:01:44,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:44,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:44,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:44,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:44,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:44,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:44,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:01:44,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:44,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:44,856 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:44,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:01:44,861 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:44,861 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:44,861 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:44,861 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:44,861 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:44,861 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:44,861 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:44,861 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:44,861 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-01-10 07:01:44,861 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:44,861 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:44,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:44,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:44,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:44,932 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:44,938 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:44,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:44,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:44,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:01:44,947 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 [2025-01-10 07:01:44,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:44,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:44,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:44,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:44,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:44,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:44,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:44,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:44,994 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-01-10 07:01:44,998 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-01-10 07:01:45,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:45,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:45,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:45,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:01:45,010 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:45,011 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:45,011 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:45,011 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -1*ULTIMATE.start_main_~p~0#1 Supporting invariants [] [2025-01-10 07:01:45,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:01:45,022 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:45,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:45,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:45,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:45,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:45,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:01:45,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:45,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:45,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:45,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:45,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:45,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:45,126 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:01:45,127 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:45,169 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 45 transitions. Complement of second has 5 states. [2025-01-10 07:01:45,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-01-10 07:01:45,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:01:45,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:01:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. [2025-01-10 07:01:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:45,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2025-01-10 07:01:45,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:01:45,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 34 transitions. [2025-01-10 07:01:45,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-01-10 07:01:45,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-01-10 07:01:45,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2025-01-10 07:01:45,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:45,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-01-10 07:01:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2025-01-10 07:01:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-01-10 07:01:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 07:01:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-01-10 07:01:45,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-01-10 07:01:45,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:45,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:01:45,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:01:45,241 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:45,266 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-01-10 07:01:45,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2025-01-10 07:01:45,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:01:45,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 29 transitions. [2025-01-10 07:01:45,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-01-10 07:01:45,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-01-10 07:01:45,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2025-01-10 07:01:45,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:01:45,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-01-10 07:01:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2025-01-10 07:01:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-01-10 07:01:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 07:01:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2025-01-10 07:01:45,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-01-10 07:01:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:01:45,271 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-01-10 07:01:45,271 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:01:45,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2025-01-10 07:01:45,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:01:45,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:45,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:45,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:01:45,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:45,275 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" [2025-01-10 07:01:45,275 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2025-01-10 07:01:45,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 2 times [2025-01-10 07:01:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:45,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458777479] [2025-01-10 07:01:45,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:45,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:45,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:45,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:45,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:45,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:45,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:45,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:45,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:45,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:45,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1788640189, now seen corresponding path program 1 times [2025-01-10 07:01:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006365205] [2025-01-10 07:01:45,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:45,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:01:45,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:01:45,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:45,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:45,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:01:45,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:01:45,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:45,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:45,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1637595894, now seen corresponding path program 1 times [2025-01-10 07:01:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:45,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44129350] [2025-01-10 07:01:45,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:45,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:01:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:01:45,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:45,330 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:45,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:01:45,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:01:45,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:45,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:45,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:01:45,468 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:45,468 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:45,468 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:45,468 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:45,468 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:45,468 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:45,468 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:45,468 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:45,468 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-01-10 07:01:45,468 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:45,468 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:45,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,522 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:45,522 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:45,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:45,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:45,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:45,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:01:45,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:45,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:45,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:45,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:45,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:45,550 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:45,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:01:45,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:45,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:45,577 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:45,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:01:45,584 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:45,584 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:45,584 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:45,584 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:45,584 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:45,584 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:45,584 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:45,584 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:45,584 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-01-10 07:01:45,584 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:45,584 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:45,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:45,629 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:45,629 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:45,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:45,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:01:45,637 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 [2025-01-10 07:01:45,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:45,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:45,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:45,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:45,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:45,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:45,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:45,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:45,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:01:45,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:45,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:45,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:45,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:01:45,662 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 [2025-01-10 07:01:45,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:45,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:45,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:45,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:45,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:45,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:45,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:45,676 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:45,677 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:01:45,677 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:01:45,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:45,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:45,682 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:45,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:01:45,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:45,683 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:45,683 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:45,684 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2025-01-10 07:01:45,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:01:45,691 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:45,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:45,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:45,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:45,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:45,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:01:45,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:45,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:01:45,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:01:45,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:45,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:45,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:01:45,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:45,795 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-01-10 07:01:45,795 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:01:46,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 151 states and 240 transitions. Complement of second has 34 states. [2025-01-10 07:01:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:01:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-01-10 07:01:46,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 4 letters. Loop has 9 letters. [2025-01-10 07:01:46,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:46,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 13 letters. Loop has 9 letters. [2025-01-10 07:01:46,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:46,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 4 letters. Loop has 18 letters. [2025-01-10 07:01:46,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:46,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 240 transitions. [2025-01-10 07:01:46,032 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-01-10 07:01:46,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 240 transitions. [2025-01-10 07:01:46,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-01-10 07:01:46,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-01-10 07:01:46,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 240 transitions. [2025-01-10 07:01:46,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:46,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 240 transitions. [2025-01-10 07:01:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 240 transitions. [2025-01-10 07:01:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2025-01-10 07:01:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 81 states have internal predecessors, (115), 28 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (48), 36 states have call predecessors, (48), 28 states have call successors, (48) [2025-01-10 07:01:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 191 transitions. [2025-01-10 07:01:46,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 191 transitions. [2025-01-10 07:01:46,046 INFO L432 stractBuchiCegarLoop]: Abstraction has 126 states and 191 transitions. [2025-01-10 07:01:46,046 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:01:46,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 191 transitions. [2025-01-10 07:01:46,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-01-10 07:01:46,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:46,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:46,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:01:46,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:46,049 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:46,049 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:46,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash 46827643, now seen corresponding path program 1 times [2025-01-10 07:01:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:46,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955096685] [2025-01-10 07:01:46,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:46,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:46,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:46,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:46,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:46,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:46,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:46,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:46,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2023007191, now seen corresponding path program 1 times [2025-01-10 07:01:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:46,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16307631] [2025-01-10 07:01:46,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:46,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:46,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:01:46,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:01:46,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16307631] [2025-01-10 07:01:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16307631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:46,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:46,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 07:01:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132159808] [2025-01-10 07:01:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:46,161 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:46,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:01:46,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:01:46,161 INFO L87 Difference]: Start difference. First operand 126 states and 191 transitions. cyclomatic complexity: 70 Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:01:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:46,312 INFO L93 Difference]: Finished difference Result 229 states and 436 transitions. [2025-01-10 07:01:46,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 436 transitions. [2025-01-10 07:01:46,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-01-10 07:01:46,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 226 states and 433 transitions. [2025-01-10 07:01:46,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-01-10 07:01:46,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-01-10 07:01:46,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 433 transitions. [2025-01-10 07:01:46,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:46,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 226 states and 433 transitions. [2025-01-10 07:01:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 433 transitions. [2025-01-10 07:01:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 167. [2025-01-10 07:01:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 102 states have internal predecessors, (139), 35 states have call successors, (35), 8 states have call predecessors, (35), 22 states have return successors, (106), 56 states have call predecessors, (106), 35 states have call successors, (106) [2025-01-10 07:01:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 280 transitions. [2025-01-10 07:01:46,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 280 transitions. [2025-01-10 07:01:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 07:01:46,369 INFO L432 stractBuchiCegarLoop]: Abstraction has 167 states and 280 transitions. [2025-01-10 07:01:46,369 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:01:46,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 280 transitions. [2025-01-10 07:01:46,371 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2025-01-10 07:01:46,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:46,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:46,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:01:46,371 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:46,371 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:46,371 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2025-01-10 07:01:46,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 46827643, now seen corresponding path program 2 times [2025-01-10 07:01:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553847996] [2025-01-10 07:01:46,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:46,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:46,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:46,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:46,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:46,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:46,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:46,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:46,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:46,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:46,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash -985344239, now seen corresponding path program 1 times [2025-01-10 07:01:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:46,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759534623] [2025-01-10 07:01:46,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:46,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:01:46,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:01:46,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:46,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:46,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:01:46,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:01:46,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:46,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:46,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1638155659, now seen corresponding path program 1 times [2025-01-10 07:01:46,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:46,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809885918] [2025-01-10 07:01:46,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:46,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:01:46,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:01:46,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:46,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:01:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:46,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809885918] [2025-01-10 07:01:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809885918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:46,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:46,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:01:46,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670834880] [2025-01-10 07:01:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:46,534 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:46,534 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:46,534 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:46,534 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:46,534 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:46,534 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:46,534 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:46,534 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:46,534 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-01-10 07:01:46,534 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:46,535 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:46,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:46,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:46,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:46,564 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:46,564 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:46,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:46,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:46,566 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:46,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:01:46,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:46,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:46,579 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:46,579 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:46,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:01:46,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:46,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:46,587 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:46,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:01:46,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:46,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:46,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:46,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:46,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:46,615 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:46,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:01:46,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:46,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:46,642 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:46,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:46,646 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:46,646 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:46,646 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:46,646 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:46,646 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:46,646 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:46,646 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:46,646 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:46,646 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-01-10 07:01:46,646 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:46,646 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:46,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:46,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:46,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:46,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:46,678 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:46,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:46,682 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:46,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:01:46,686 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 [2025-01-10 07:01:46,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:46,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:46,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:46,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:46,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:46,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:46,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:46,699 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:46,701 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:01:46,701 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:01:46,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:46,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:46,704 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:46,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:01:46,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:46,706 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:46,706 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:46,706 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 1 Supporting invariants [] [2025-01-10 07:01:46,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:01:46,716 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:46,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:46,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:46,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:46,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:46,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:01:46,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:46,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:01:46,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:01:46,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:46,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:46,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:01:46,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:46,886 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-01-10 07:01:46,886 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 167 states and 280 transitions. cyclomatic complexity: 118 Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:01:47,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 167 states and 280 transitions. cyclomatic complexity: 118. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 958 states and 1806 transitions. Complement of second has 39 states. [2025-01-10 07:01:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:01:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2025-01-10 07:01:47,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 5 letters. Loop has 8 letters. [2025-01-10 07:01:47,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:47,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 13 letters. Loop has 8 letters. [2025-01-10 07:01:47,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:47,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 5 letters. Loop has 16 letters. [2025-01-10 07:01:47,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:47,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 958 states and 1806 transitions. [2025-01-10 07:01:47,205 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2025-01-10 07:01:47,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 958 states to 838 states and 1552 transitions. [2025-01-10 07:01:47,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2025-01-10 07:01:47,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-01-10 07:01:47,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 838 states and 1552 transitions. [2025-01-10 07:01:47,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:47,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 838 states and 1552 transitions. [2025-01-10 07:01:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states and 1552 transitions. [2025-01-10 07:01:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 675. [2025-01-10 07:01:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 433 states have (on average 1.2678983833718245) internal successors, (549), 406 states have internal predecessors, (549), 156 states have call successors, (156), 39 states have call predecessors, (156), 86 states have return successors, (427), 229 states have call predecessors, (427), 152 states have call successors, (427) [2025-01-10 07:01:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1132 transitions. [2025-01-10 07:01:47,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 675 states and 1132 transitions. [2025-01-10 07:01:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:47,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:01:47,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:01:47,335 INFO L87 Difference]: Start difference. First operand 675 states and 1132 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:01:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:47,404 INFO L93 Difference]: Finished difference Result 736 states and 1284 transitions. [2025-01-10 07:01:47,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 736 states and 1284 transitions. [2025-01-10 07:01:47,412 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-01-10 07:01:47,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 736 states to 311 states and 534 transitions. [2025-01-10 07:01:47,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-01-10 07:01:47,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-01-10 07:01:47,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 534 transitions. [2025-01-10 07:01:47,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:47,419 INFO L218 hiAutomatonCegarLoop]: Abstraction has 311 states and 534 transitions. [2025-01-10 07:01:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 534 transitions. [2025-01-10 07:01:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 255. [2025-01-10 07:01:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 163 states have (on average 1.2760736196319018) internal successors, (208), 159 states have internal predecessors, (208), 61 states have call successors, (61), 16 states have call predecessors, (61), 31 states have return successors, (136), 79 states have call predecessors, (136), 55 states have call successors, (136) [2025-01-10 07:01:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 405 transitions. [2025-01-10 07:01:47,431 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 405 transitions. [2025-01-10 07:01:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:01:47,431 INFO L432 stractBuchiCegarLoop]: Abstraction has 255 states and 405 transitions. [2025-01-10 07:01:47,431 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:01:47,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 405 transitions. [2025-01-10 07:01:47,433 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-01-10 07:01:47,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:47,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:47,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:47,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:47,433 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" [2025-01-10 07:01:47,433 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" [2025-01-10 07:01:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1123490516, now seen corresponding path program 1 times [2025-01-10 07:01:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:47,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600868437] [2025-01-10 07:01:47,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:47,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:47,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:01:47,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:01:47,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:47,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:47,443 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:47,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:01:47,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:01:47,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:47,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:47,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:47,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash 643089633, now seen corresponding path program 1 times [2025-01-10 07:01:47,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:47,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427713727] [2025-01-10 07:01:47,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:47,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:01:47,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:01:47,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:47,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:47,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:47,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:01:47,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:01:47,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:47,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:47,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1822713518, now seen corresponding path program 1 times [2025-01-10 07:01:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543690467] [2025-01-10 07:01:47,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:47,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:01:47,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:01:47,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:47,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:47,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:47,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:01:47,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:01:47,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:47,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:47,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:47,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:47,534 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:47,534 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:47,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:47,535 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:47,535 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:47,535 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,535 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:47,535 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:47,535 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-01-10 07:01:47,535 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:47,535 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:47,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:47,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:47,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:47,556 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:47,556 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:47,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:47,558 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:47,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:01:47,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:47,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:47,572 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:47,572 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:47,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:01:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:47,580 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:47,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:01:47,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:47,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:47,600 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:47,600 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=0} Honda state: {ULTIMATE.start_main_~p~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:47,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:47,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:47,608 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:47,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:01:47,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:47,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:47,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:47,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:47,630 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:47,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:01:47,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:47,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:47,724 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:47,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:47,729 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:47,729 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:47,729 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:47,729 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:47,729 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:47,729 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,729 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:47,729 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:47,729 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-01-10 07:01:47,729 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:47,729 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:47,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:47,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:47,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:47,758 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:47,758 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:47,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:47,763 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:47,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:01:47,764 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 [2025-01-10 07:01:47,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:47,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:47,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:47,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:47,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:47,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:47,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:47,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:47,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 07:01:47,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:47,806 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:47,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:01:47,810 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 [2025-01-10 07:01:47,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:47,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:47,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:47,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:47,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:47,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:47,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:47,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:47,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 07:01:47,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:47,852 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:47,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:01:47,854 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 [2025-01-10 07:01:47,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:47,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:47,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:47,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:47,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:47,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:47,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:47,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:47,889 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 07:01:47,889 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:01:47,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:47,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:47,891 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:47,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 07:01:47,894 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:47,894 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:47,894 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:47,894 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~q~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 07:01:47,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 07:01:47,907 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:47,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:01:47,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:01:47,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:47,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:47,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:01:47,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:48,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:01:48,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:01:48,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:48,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:48,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:48,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:48,093 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:01:48,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 405 transitions. cyclomatic complexity: 158 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:01:48,222 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 405 transitions. cyclomatic complexity: 158. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 387 states and 597 transitions. Complement of second has 13 states. [2025-01-10 07:01:48,222 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 [2025-01-10 07:01:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:01:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2025-01-10 07:01:48,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 7 letters. [2025-01-10 07:01:48,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:48,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 18 letters. Loop has 7 letters. [2025-01-10 07:01:48,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:48,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 14 letters. [2025-01-10 07:01:48,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:48,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 597 transitions. [2025-01-10 07:01:48,237 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-01-10 07:01:48,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 315 states and 490 transitions. [2025-01-10 07:01:48,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2025-01-10 07:01:48,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2025-01-10 07:01:48,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 490 transitions. [2025-01-10 07:01:48,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:48,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 315 states and 490 transitions. [2025-01-10 07:01:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 490 transitions. [2025-01-10 07:01:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2025-01-10 07:01:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 200 states have (on average 1.265) internal successors, (253), 195 states have internal predecessors, (253), 77 states have call successors, (79), 22 states have call predecessors, (79), 37 states have return successors, (157), 96 states have call predecessors, (157), 68 states have call successors, (157) [2025-01-10 07:01:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 489 transitions. [2025-01-10 07:01:48,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-01-10 07:01:48,266 INFO L432 stractBuchiCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-01-10 07:01:48,266 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:01:48,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 489 transitions. [2025-01-10 07:01:48,272 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-01-10 07:01:48,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:48,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:48,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:48,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:01:48,274 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< [2025-01-10 07:01:48,274 INFO L754 eck$LassoCheckResult]: Loop: "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< [2025-01-10 07:01:48,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash 468486463, now seen corresponding path program 1 times [2025-01-10 07:01:48,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:48,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797543478] [2025-01-10 07:01:48,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:48,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:48,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:01:48,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:01:48,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:48,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:48,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:48,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797543478] [2025-01-10 07:01:48,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797543478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:48,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:48,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:01:48,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255154735] [2025-01-10 07:01:48,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:48,338 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:01:48,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash 28756393, now seen corresponding path program 1 times [2025-01-10 07:01:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120241641] [2025-01-10 07:01:48,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:48,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:48,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:48,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:48,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:48,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:48,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:48,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:48,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:48,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:48,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:48,424 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:48,424 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:48,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:48,424 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:48,424 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:48,424 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:48,424 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:48,424 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:48,424 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-01-10 07:01:48,424 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:48,424 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:48,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,495 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:48,496 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:48,498 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:48,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 07:01:48,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:48,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:48,510 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:48,511 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:48,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-01-10 07:01:48,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:48,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:48,518 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:48,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-01-10 07:01:48,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:48,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:48,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:48,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:48,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:48,545 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:48,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-01-10 07:01:48,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:48,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:48,682 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:48,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:48,688 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:48,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:48,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:48,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:48,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:48,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:48,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:48,689 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:48,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-01-10 07:01:48,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:48,689 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:48,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:48,745 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:48,745 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:48,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:48,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:48,747 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:48,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-01-10 07:01:48,750 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 [2025-01-10 07:01:48,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:48,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:48,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:48,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:48,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:48,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:48,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:48,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:48,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:48,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:48,771 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:48,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-01-10 07:01:48,773 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 [2025-01-10 07:01:48,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:48,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:48,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:48,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:48,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:48,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:48,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:48,787 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:48,790 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:01:48,790 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:01:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:48,793 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:48,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 07:01:48,794 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:48,794 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:48,794 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:48,795 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-01-10 07:01:48,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-01-10 07:01:48,802 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:48,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:48,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:01:48,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:01:48,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:48,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:48,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:48,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:48,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:48,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:48,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:48,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:48,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:01:48,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:48,932 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 07:01:48,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 489 transitions. cyclomatic complexity: 184 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:49,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:49,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 07:01:49,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 489 transitions. cyclomatic complexity: 184. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1007 states and 2044 transitions. Complement of second has 45 states. [2025-01-10 07:01:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-01-10 07:01:49,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 12 letters. Loop has 5 letters. [2025-01-10 07:01:49,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:49,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 17 letters. Loop has 5 letters. [2025-01-10 07:01:49,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:49,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 12 letters. Loop has 10 letters. [2025-01-10 07:01:49,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:49,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1007 states and 2044 transitions. [2025-01-10 07:01:49,133 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 165 [2025-01-10 07:01:49,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1007 states to 912 states and 1870 transitions. [2025-01-10 07:01:49,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2025-01-10 07:01:49,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 501 [2025-01-10 07:01:49,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 912 states and 1870 transitions. [2025-01-10 07:01:49,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:49,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 912 states and 1870 transitions. [2025-01-10 07:01:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states and 1870 transitions. [2025-01-10 07:01:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 810. [2025-01-10 07:01:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 494 states have (on average 1.3218623481781377) internal successors, (653), 539 states have internal predecessors, (653), 216 states have call successors, (218), 67 states have call predecessors, (218), 100 states have return successors, (670), 203 states have call predecessors, (670), 191 states have call successors, (670) [2025-01-10 07:01:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1541 transitions. [2025-01-10 07:01:49,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 810 states and 1541 transitions. [2025-01-10 07:01:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:49,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:01:49,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:01:49,173 INFO L87 Difference]: Start difference. First operand 810 states and 1541 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:49,201 INFO L93 Difference]: Finished difference Result 716 states and 1339 transitions. [2025-01-10 07:01:49,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 716 states and 1339 transitions. [2025-01-10 07:01:49,208 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 104 [2025-01-10 07:01:49,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 716 states to 715 states and 1338 transitions. [2025-01-10 07:01:49,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-01-10 07:01:49,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2025-01-10 07:01:49,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 715 states and 1338 transitions. [2025-01-10 07:01:49,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:49,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 715 states and 1338 transitions. [2025-01-10 07:01:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states and 1338 transitions. [2025-01-10 07:01:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 707. [2025-01-10 07:01:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 440 states have (on average 1.3) internal successors, (572), 480 states have internal predecessors, (572), 174 states have call successors, (176), 58 states have call predecessors, (176), 93 states have return successors, (582), 168 states have call predecessors, (582), 156 states have call successors, (582) [2025-01-10 07:01:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1330 transitions. [2025-01-10 07:01:49,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 707 states and 1330 transitions. [2025-01-10 07:01:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:01:49,235 INFO L432 stractBuchiCegarLoop]: Abstraction has 707 states and 1330 transitions. [2025-01-10 07:01:49,235 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:01:49,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 707 states and 1330 transitions. [2025-01-10 07:01:49,239 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-01-10 07:01:49,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:49,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:49,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:49,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:49,240 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:49,240 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:49,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash -774134803, now seen corresponding path program 2 times [2025-01-10 07:01:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:49,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843789603] [2025-01-10 07:01:49,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:49,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 07:01:49,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:01:49,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:01:49,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843789603] [2025-01-10 07:01:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843789603] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999504226] [2025-01-10 07:01:49,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:49,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:49,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:49,275 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:49,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-01-10 07:01:49,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 07:01:49,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:01:49,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:01:49,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:49,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:49,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:49,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999504226] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:49,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-10 07:01:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939343946] [2025-01-10 07:01:49,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:49,356 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:01:49,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 408732585, now seen corresponding path program 1 times [2025-01-10 07:01:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953822562] [2025-01-10 07:01:49,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:49,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:01:49,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:01:49,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:49,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:01:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953822562] [2025-01-10 07:01:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953822562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452295174] [2025-01-10 07:01:49,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:49,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:49,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:49,497 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:49,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-01-10 07:01:49,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:01:49,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:01:49,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:49,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:49,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:01:49,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:01:49,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:01:49,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452295174] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:49,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:49,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 07:01:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399817342] [2025-01-10 07:01:49,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:49,720 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:49,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 07:01:49,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 07:01:49,720 INFO L87 Difference]: Start difference. First operand 707 states and 1330 transitions. cyclomatic complexity: 643 Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:01:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:49,752 INFO L93 Difference]: Finished difference Result 755 states and 1413 transitions. [2025-01-10 07:01:49,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 1413 transitions. [2025-01-10 07:01:49,759 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 112 [2025-01-10 07:01:49,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 752 states and 1409 transitions. [2025-01-10 07:01:49,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-01-10 07:01:49,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2025-01-10 07:01:49,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 752 states and 1409 transitions. [2025-01-10 07:01:49,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:49,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 752 states and 1409 transitions. [2025-01-10 07:01:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states and 1409 transitions. [2025-01-10 07:01:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 706. [2025-01-10 07:01:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 439 states have (on average 1.2984054669703873) internal successors, (570), 480 states have internal predecessors, (570), 174 states have call successors, (176), 58 states have call predecessors, (176), 93 states have return successors, (582), 167 states have call predecessors, (582), 156 states have call successors, (582) [2025-01-10 07:01:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1328 transitions. [2025-01-10 07:01:49,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 1328 transitions. [2025-01-10 07:01:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:01:49,788 INFO L432 stractBuchiCegarLoop]: Abstraction has 706 states and 1328 transitions. [2025-01-10 07:01:49,788 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:01:49,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 1328 transitions. [2025-01-10 07:01:49,791 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-01-10 07:01:49,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:49,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:49,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 07:01:49,792 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:49,792 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:49,792 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:49,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash -813067821, now seen corresponding path program 3 times [2025-01-10 07:01:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633619899] [2025-01-10 07:01:49,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:49,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:49,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-01-10 07:01:49,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:01:49,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:01:49,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:49,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:49,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 07:01:49,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:01:49,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:49,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:49,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:49,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash 408732585, now seen corresponding path program 2 times [2025-01-10 07:01:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:49,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822727280] [2025-01-10 07:01:49,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:49,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 07:01:49,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:01:49,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:01:49,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:01:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822727280] [2025-01-10 07:01:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822727280] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388519052] [2025-01-10 07:01:49,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:49,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:49,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:49,895 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:49,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-01-10 07:01:49,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 07:01:49,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:01:49,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:01:49,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:49,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:01:49,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:01:50,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:01:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388519052] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:50,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 07:01:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485733289] [2025-01-10 07:01:50,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:50,124 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:50,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 07:01:50,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-01-10 07:01:50,125 INFO L87 Difference]: Start difference. First operand 706 states and 1328 transitions. cyclomatic complexity: 642 Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 07:01:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:50,395 INFO L93 Difference]: Finished difference Result 1107 states and 2858 transitions. [2025-01-10 07:01:50,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1107 states and 2858 transitions. [2025-01-10 07:01:50,411 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 181 [2025-01-10 07:01:50,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1107 states to 1090 states and 2809 transitions. [2025-01-10 07:01:50,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2025-01-10 07:01:50,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2025-01-10 07:01:50,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1090 states and 2809 transitions. [2025-01-10 07:01:50,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:50,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1090 states and 2809 transitions. [2025-01-10 07:01:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states and 2809 transitions. [2025-01-10 07:01:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 749. [2025-01-10 07:01:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 461 states have (on average 1.2819956616052062) internal successors, (591), 522 states have internal predecessors, (591), 180 states have call successors, (182), 58 states have call predecessors, (182), 108 states have return successors, (792), 168 states have call predecessors, (792), 162 states have call successors, (792) [2025-01-10 07:01:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1565 transitions. [2025-01-10 07:01:50,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 749 states and 1565 transitions. [2025-01-10 07:01:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 07:01:50,474 INFO L432 stractBuchiCegarLoop]: Abstraction has 749 states and 1565 transitions. [2025-01-10 07:01:50,474 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:01:50,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 749 states and 1565 transitions. [2025-01-10 07:01:50,479 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-01-10 07:01:50,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:50,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:50,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 07:01:50,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2025-01-10 07:01:50,481 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:50,481 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-01-10 07:01:50,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash -813067821, now seen corresponding path program 4 times [2025-01-10 07:01:50,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:50,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247396071] [2025-01-10 07:01:50,483 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:01:50,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:50,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-01-10 07:01:50,489 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:01:50,490 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:01:50,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:50,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:50,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 07:01:50,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:01:50,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:50,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:50,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1224674345, now seen corresponding path program 3 times [2025-01-10 07:01:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664994285] [2025-01-10 07:01:50,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:50,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-01-10 07:01:50,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-01-10 07:01:50,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:01:50,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 07:01:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:50,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664994285] [2025-01-10 07:01:50,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664994285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:50,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076587463] [2025-01-10 07:01:50,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:50,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:50,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:50,635 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:50,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-01-10 07:01:50,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-01-10 07:01:50,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-01-10 07:01:50,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:01:50,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:50,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 07:01:50,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-10 07:01:50,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 07:01:51,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076587463] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:51,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:51,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2025-01-10 07:01:51,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061192911] [2025-01-10 07:01:51,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:51,019 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:51,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:51,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 07:01:51,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-01-10 07:01:51,020 INFO L87 Difference]: Start difference. First operand 749 states and 1565 transitions. cyclomatic complexity: 836 Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-10 07:01:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:51,348 INFO L93 Difference]: Finished difference Result 1355 states and 2923 transitions. [2025-01-10 07:01:51,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1355 states and 2923 transitions. [2025-01-10 07:01:51,380 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 160 [2025-01-10 07:01:51,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1355 states to 1279 states and 2785 transitions. [2025-01-10 07:01:51,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-01-10 07:01:51,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2025-01-10 07:01:51,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 2785 transitions. [2025-01-10 07:01:51,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:51,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1279 states and 2785 transitions. [2025-01-10 07:01:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 2785 transitions. [2025-01-10 07:01:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 996. [2025-01-10 07:01:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 630 states have (on average 1.2095238095238094) internal successors, (762), 693 states have internal predecessors, (762), 201 states have call successors, (203), 81 states have call predecessors, (203), 165 states have return successors, (1147), 221 states have call predecessors, (1147), 195 states have call successors, (1147) [2025-01-10 07:01:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 2112 transitions. [2025-01-10 07:01:51,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 996 states and 2112 transitions. [2025-01-10 07:01:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 07:01:51,433 INFO L432 stractBuchiCegarLoop]: Abstraction has 996 states and 2112 transitions. [2025-01-10 07:01:51,433 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:01:51,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 2112 transitions. [2025-01-10 07:01:51,439 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 110 [2025-01-10 07:01:51,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:51,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:51,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:51,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:01:51,440 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< [2025-01-10 07:01:51,440 INFO L754 eck$LassoCheckResult]: Loop: "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< [2025-01-10 07:01:51,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1638148124, now seen corresponding path program 1 times [2025-01-10 07:01:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187640740] [2025-01-10 07:01:51,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:51,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 07:01:51,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:01:51,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:51,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 07:01:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187640740] [2025-01-10 07:01:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187640740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:51,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:01:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904533445] [2025-01-10 07:01:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:51,477 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:01:51,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:51,477 INFO L85 PathProgramCache]: Analyzing trace with hash 28756488, now seen corresponding path program 1 times [2025-01-10 07:01:51,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:51,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618009130] [2025-01-10 07:01:51,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:51,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:51,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:51,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:51,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:51,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:51,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:51,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:51,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:51,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:51,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:51,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:51,521 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:51,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:51,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:51,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:51,521 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:51,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:51,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:51,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-01-10 07:01:51,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:51,521 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:51,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,561 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:51,561 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,564 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 07:01:51,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:51,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:51,577 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:51,577 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:51,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:51,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,586 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 07:01:51,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:51,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:51,598 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:51,598 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:51,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-01-10 07:01:51,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,606 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 07:01:51,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:51,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:51,621 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:51,621 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:51,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-01-10 07:01:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,630 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-01-10 07:01:51,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:51,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:51,642 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:51,642 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:51,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-01-10 07:01:51,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,651 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-01-10 07:01:51,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:51,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:51,664 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:51,664 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:51,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:51,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,672 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-01-10 07:01:51,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:51,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:51,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:51,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,693 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-01-10 07:01:51,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:51,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:51,737 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:51,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:51,741 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:51,741 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:51,741 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:51,741 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:51,741 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:51,741 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,741 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:51,741 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:51,741 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-01-10 07:01:51,741 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:51,741 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:51,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:51,785 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:51,785 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:51,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,787 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-01-10 07:01:51,790 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 [2025-01-10 07:01:51,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:51,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:51,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:51,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:51,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:51,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:51,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:51,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:51,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-01-10 07:01:51,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,809 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-01-10 07:01:51,811 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 [2025-01-10 07:01:51,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:51,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:51,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:51,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:51,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:51,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:51,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:51,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:51,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:51,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,830 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-01-10 07:01:51,832 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 [2025-01-10 07:01:51,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:51,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:51,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:51,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:51,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:51,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:51,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:51,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:51,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-01-10 07:01:51,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,852 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-01-10 07:01:51,856 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 [2025-01-10 07:01:51,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:51,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:51,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:51,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:51,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:51,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:51,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:51,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:51,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:51,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,874 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-01-10 07:01:51,877 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 [2025-01-10 07:01:51,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:51,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:51,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:51,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:51,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:51,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:51,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:51,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:51,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-01-10 07:01:51,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,899 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 07:01:51,902 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 [2025-01-10 07:01:51,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:51,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:51,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:51,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:51,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:51,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:51,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:51,914 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:51,917 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:01:51,917 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:01:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:51,920 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:51,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 07:01:51,922 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:51,922 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:51,923 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:51,923 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2025-01-10 07:01:51,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-01-10 07:01:51,929 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:51,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:51,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 07:01:51,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:01:51,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:51,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:51,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:01:51,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:52,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:52,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:52,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:52,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:52,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:01:52,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:52,127 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:01:52,127 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 996 states and 2112 transitions. cyclomatic complexity: 1136 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:01:52,321 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 996 states and 2112 transitions. cyclomatic complexity: 1136. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 1889 states and 3790 transitions. Complement of second has 34 states. [2025-01-10 07:01:52,322 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 [2025-01-10 07:01:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:01:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2025-01-10 07:01:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 24 letters. Loop has 5 letters. [2025-01-10 07:01:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 29 letters. Loop has 5 letters. [2025-01-10 07:01:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 24 letters. Loop has 10 letters. [2025-01-10 07:01:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:52,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1889 states and 3790 transitions. [2025-01-10 07:01:52,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-01-10 07:01:52,365 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 122 [2025-01-10 07:01:52,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1889 states to 1647 states and 3417 transitions. [2025-01-10 07:01:52,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 718 [2025-01-10 07:01:52,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 744 [2025-01-10 07:01:52,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1647 states and 3417 transitions. [2025-01-10 07:01:52,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:52,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1647 states and 3417 transitions. [2025-01-10 07:01:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states and 3417 transitions. [2025-01-10 07:01:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1563. [2025-01-10 07:01:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1025 states have (on average 1.2448780487804878) internal successors, (1276), 1176 states have internal predecessors, (1276), 291 states have call successors, (293), 141 states have call predecessors, (293), 247 states have return successors, (1630), 245 states have call predecessors, (1630), 285 states have call successors, (1630) [2025-01-10 07:01:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 3199 transitions. [2025-01-10 07:01:52,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1563 states and 3199 transitions. [2025-01-10 07:01:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:52,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:01:52,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:01:52,424 INFO L87 Difference]: Start difference. First operand 1563 states and 3199 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2025-01-10 07:01:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:52,474 INFO L93 Difference]: Finished difference Result 1287 states and 2712 transitions. [2025-01-10 07:01:52,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1287 states and 2712 transitions. [2025-01-10 07:01:52,484 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-01-10 07:01:52,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1287 states to 1271 states and 2695 transitions. [2025-01-10 07:01:52,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2025-01-10 07:01:52,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2025-01-10 07:01:52,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1271 states and 2695 transitions. [2025-01-10 07:01:52,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:52,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-01-10 07:01:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states and 2695 transitions. [2025-01-10 07:01:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2025-01-10 07:01:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 832 states have (on average 1.2524038461538463) internal successors, (1042), 957 states have internal predecessors, (1042), 232 states have call successors, (233), 109 states have call predecessors, (233), 207 states have return successors, (1420), 204 states have call predecessors, (1420), 232 states have call successors, (1420) [2025-01-10 07:01:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2695 transitions. [2025-01-10 07:01:52,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-01-10 07:01:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:01:52,528 INFO L432 stractBuchiCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-01-10 07:01:52,528 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:01:52,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1271 states and 2695 transitions. [2025-01-10 07:01:52,533 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-01-10 07:01:52,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:52,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:52,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 07:01:52,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:52,534 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" [2025-01-10 07:01:52,534 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" [2025-01-10 07:01:52,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1951415764, now seen corresponding path program 5 times [2025-01-10 07:01:52,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:52,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602496484] [2025-01-10 07:01:52,534 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:01:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:52,537 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-01-10 07:01:52,539 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:01:52,539 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 07:01:52,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 07:01:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:52,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602496484] [2025-01-10 07:01:52,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602496484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:52,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:52,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:01:52,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619516533] [2025-01-10 07:01:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:52,581 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:01:52,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash 643089633, now seen corresponding path program 2 times [2025-01-10 07:01:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:52,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809147101] [2025-01-10 07:01:52,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:52,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:52,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:01:52,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:01:52,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:52,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:52,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:52,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:01:52,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:01:52,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:52,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:52,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:52,678 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:52,678 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:52,678 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:52,678 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:52,678 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:52,678 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:52,678 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:52,678 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:52,678 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-01-10 07:01:52,678 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:52,678 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:52,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:52,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:52,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:52,707 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:52,707 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:52,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:52,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:52,709 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:52,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-01-10 07:01:52,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:52,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:52,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:52,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:52,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:52,733 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:52,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-01-10 07:01:52,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:52,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:52,828 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:52,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:52,837 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:52,837 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:52,837 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:52,837 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:52,837 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:52,837 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:52,837 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:52,837 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:52,837 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-01-10 07:01:52,837 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:52,837 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:52,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:52,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:52,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:52,880 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:52,880 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:52,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:52,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:52,882 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:52,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 07:01:52,886 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 [2025-01-10 07:01:52,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:52,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:52,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:52,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:52,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:52,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:52,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:52,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:52,900 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 07:01:52,900 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:01:52,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:52,904 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:52,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 07:01:52,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:52,907 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:52,907 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:52,907 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~q~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~q~0#1 Supporting invariants [] [2025-01-10 07:01:52,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:52,913 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:52,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:52,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:01:52,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:01:52,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:52,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:52,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:01:52,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:53,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:01:53,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:01:53,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:53,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:53,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:53,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:53,158 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:01:53,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:53,199 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1284 states and 2709 transitions. Complement of second has 10 states. [2025-01-10 07:01:53,204 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 [2025-01-10 07:01:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-01-10 07:01:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 27 letters. Loop has 7 letters. [2025-01-10 07:01:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:53,204 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:01:53,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:53,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:01:53,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:01:53,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:53,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:53,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:01:53,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:53,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:01:53,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:01:53,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:53,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:53,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:53,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:53,460 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:01:53,460 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:53,536 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1282 states and 2706 transitions. Complement of second has 10 states. [2025-01-10 07:01:53,537 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 [2025-01-10 07:01:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-01-10 07:01:53,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 27 letters. Loop has 7 letters. [2025-01-10 07:01:53,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:53,537 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:01:53,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:53,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:01:53,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:01:53,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:53,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:53,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:01:53,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:53,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:01:53,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:01:53,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:53,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:53,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:53,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:53,787 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 4 loop predicates [2025-01-10 07:01:53,787 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:53,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 2445 states and 5285 transitions. Complement of second has 11 states. [2025-01-10 07:01:53,916 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 [2025-01-10 07:01:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2025-01-10 07:01:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 27 letters. Loop has 7 letters. [2025-01-10 07:01:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 34 letters. Loop has 7 letters. [2025-01-10 07:01:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 27 letters. Loop has 14 letters. [2025-01-10 07:01:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:53,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2445 states and 5285 transitions. [2025-01-10 07:01:53,935 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 57 [2025-01-10 07:01:53,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2445 states to 2000 states and 4030 transitions. [2025-01-10 07:01:53,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-01-10 07:01:53,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2025-01-10 07:01:53,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2000 states and 4030 transitions. [2025-01-10 07:01:53,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:53,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2000 states and 4030 transitions. [2025-01-10 07:01:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states and 4030 transitions. [2025-01-10 07:01:54,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-01-10 07:01:54,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1924. [2025-01-10 07:01:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1279 states have (on average 1.236903831118061) internal successors, (1582), 1452 states have internal predecessors, (1582), 355 states have call successors, (372), 185 states have call predecessors, (372), 290 states have return successors, (1925), 286 states have call predecessors, (1925), 343 states have call successors, (1925) [2025-01-10 07:01:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3879 transitions. [2025-01-10 07:01:54,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1924 states and 3879 transitions. [2025-01-10 07:01:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:54,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:01:54,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:01:54,041 INFO L87 Difference]: Start difference. First operand 1924 states and 3879 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:01:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:54,161 INFO L93 Difference]: Finished difference Result 1127 states and 2232 transitions. [2025-01-10 07:01:54,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1127 states and 2232 transitions. [2025-01-10 07:01:54,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-01-10 07:01:54,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1127 states to 620 states and 1244 transitions. [2025-01-10 07:01:54,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-01-10 07:01:54,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 244 [2025-01-10 07:01:54,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 620 states and 1244 transitions. [2025-01-10 07:01:54,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:54,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 620 states and 1244 transitions. [2025-01-10 07:01:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states and 1244 transitions. [2025-01-10 07:01:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 574. [2025-01-10 07:01:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 383 states have (on average 1.216710182767624) internal successors, (466), 425 states have internal predecessors, (466), 102 states have call successors, (108), 57 states have call predecessors, (108), 89 states have return successors, (576), 91 states have call predecessors, (576), 99 states have call successors, (576) [2025-01-10 07:01:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1150 transitions. [2025-01-10 07:01:54,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 574 states and 1150 transitions. [2025-01-10 07:01:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:01:54,189 INFO L432 stractBuchiCegarLoop]: Abstraction has 574 states and 1150 transitions. [2025-01-10 07:01:54,189 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:01:54,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 1150 transitions. [2025-01-10 07:01:54,191 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-01-10 07:01:54,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:54,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:54,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:54,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2] [2025-01-10 07:01:54,192 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-01-10 07:01:54,192 INFO L754 eck$LassoCheckResult]: Loop: "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-01-10 07:01:54,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2129396410, now seen corresponding path program 1 times [2025-01-10 07:01:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:54,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141106353] [2025-01-10 07:01:54,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:54,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 07:01:54,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 07:01:54,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:54,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:54,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:54,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 07:01:54,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 07:01:54,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:54,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:54,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:54,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1681734298, now seen corresponding path program 1 times [2025-01-10 07:01:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583156543] [2025-01-10 07:01:54,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:54,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 07:01:54,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 07:01:54,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:54,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-10 07:01:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583156543] [2025-01-10 07:01:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583156543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079531377] [2025-01-10 07:01:54,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:54,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:54,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:54,247 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:54,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-01-10 07:01:54,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 07:01:54,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 07:01:54,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:54,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:54,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:01:54,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 07:01:54,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:01:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079531377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:54,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:01:54,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-01-10 07:01:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213157620] [2025-01-10 07:01:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:54,308 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:54,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:01:54,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:01:54,308 INFO L87 Difference]: Start difference. First operand 574 states and 1150 transitions. cyclomatic complexity: 595 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 07:01:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:54,379 INFO L93 Difference]: Finished difference Result 541 states and 976 transitions. [2025-01-10 07:01:54,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 541 states and 976 transitions. [2025-01-10 07:01:54,382 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-01-10 07:01:54,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 541 states to 499 states and 928 transitions. [2025-01-10 07:01:54,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2025-01-10 07:01:54,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2025-01-10 07:01:54,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 499 states and 928 transitions. [2025-01-10 07:01:54,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:54,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 499 states and 928 transitions. [2025-01-10 07:01:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states and 928 transitions. [2025-01-10 07:01:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 489. [2025-01-10 07:01:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 328 states have (on average 1.1890243902439024) internal successors, (390), 355 states have internal predecessors, (390), 97 states have call successors, (103), 53 states have call predecessors, (103), 64 states have return successors, (422), 80 states have call predecessors, (422), 94 states have call successors, (422) [2025-01-10 07:01:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 915 transitions. [2025-01-10 07:01:54,396 INFO L240 hiAutomatonCegarLoop]: Abstraction has 489 states and 915 transitions. [2025-01-10 07:01:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:01:54,397 INFO L432 stractBuchiCegarLoop]: Abstraction has 489 states and 915 transitions. [2025-01-10 07:01:54,397 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-01-10 07:01:54,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 489 states and 915 transitions. [2025-01-10 07:01:54,398 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-01-10 07:01:54,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:54,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:54,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:54,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:54,399 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-01-10 07:01:54,399 INFO L754 eck$LassoCheckResult]: Loop: "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-01-10 07:01:54,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2129396410, now seen corresponding path program 2 times [2025-01-10 07:01:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:54,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6170065] [2025-01-10 07:01:54,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:54,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-10 07:01:54,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 07:01:54,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:01:54,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:54,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:54,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 07:01:54,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 07:01:54,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:54,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:54,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:54,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1621090856, now seen corresponding path program 1 times [2025-01-10 07:01:54,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:54,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679126128] [2025-01-10 07:01:54,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:54,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:54,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:01:54,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:01:54,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:54,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:54,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:01:54,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:01:54,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:54,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:54,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:54,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1959358047, now seen corresponding path program 3 times [2025-01-10 07:01:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443716464] [2025-01-10 07:01:54,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:54,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-01-10 07:01:54,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 07:01:54,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:01:54,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 07:01:54,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443716464] [2025-01-10 07:01:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443716464] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066950586] [2025-01-10 07:01:54,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:54,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:54,510 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:54,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-01-10 07:01:54,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-01-10 07:01:54,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 07:01:54,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:01:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:54,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:01:54,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 07:01:54,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 07:01:54,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066950586] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:54,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:54,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-01-10 07:01:54,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931665534] [2025-01-10 07:01:54,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:54,860 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:54,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:54,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:54,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:54,860 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:54,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:54,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:54,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:54,861 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2025-01-10 07:01:54,861 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:54,861 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:54,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:54,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:54,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:54,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:54,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:54,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:54,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:54,936 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:54,936 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:54,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:54,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:54,939 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:54,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-01-10 07:01:54,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:54,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:54,955 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:54,955 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:54,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-01-10 07:01:54,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:54,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:54,962 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:54,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-01-10 07:01:54,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:54,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:54,978 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:54,978 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:54,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-01-10 07:01:54,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:54,990 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:54,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-01-10 07:01:54,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:54,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,003 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:55,003 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:55,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,014 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-01-10 07:01:55,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:55,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,030 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:55,030 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:55,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,039 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-01-10 07:01:55,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:55,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,055 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:55,055 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:55,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,063 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-01-10 07:01:55,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:55,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-01-10 07:01:55,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,088 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-01-10 07:01:55,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:55,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,183 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:55,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,189 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:55,189 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:55,189 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:55,189 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:55,189 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:55,189 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,189 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:55,189 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:55,189 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2025-01-10 07:01:55,189 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:55,189 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:55,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,263 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:55,263 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:55,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,265 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-01-10 07:01:55,267 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 [2025-01-10 07:01:55,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:55,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:55,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:55,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:55,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:55,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:55,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:55,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:55,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,286 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-01-10 07:01:55,288 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 [2025-01-10 07:01:55,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:55,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:55,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:55,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:55,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:55,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:55,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:55,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:55,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,308 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-01-10 07:01:55,310 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 [2025-01-10 07:01:55,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:55,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:55,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:55,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:55,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:55,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:55,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:55,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:55,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,330 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-01-10 07:01:55,332 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 [2025-01-10 07:01:55,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:55,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:55,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:55,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:55,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:55,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:55,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:55,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:55,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,351 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-01-10 07:01:55,353 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 [2025-01-10 07:01:55,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:55,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:55,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:55,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:55,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:55,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:55,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:55,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:55,369 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:01:55,369 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:01:55,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,373 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-01-10 07:01:55,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:55,375 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:55,375 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:55,375 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-01-10 07:01:55,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,382 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:55,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:55,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 07:01:55,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 07:01:55,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:55,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:55,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 07:01:55,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:55,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:01:55,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:01:55,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:55,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:55,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:01:55,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:55,683 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:01:55,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 489 states and 915 transitions. cyclomatic complexity: 445 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:55,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 489 states and 915 transitions. cyclomatic complexity: 445. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1831 states and 3438 transitions. Complement of second has 41 states. [2025-01-10 07:01:55,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2025-01-10 07:01:55,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 41 letters. Loop has 10 letters. [2025-01-10 07:01:55,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:55,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 51 letters. Loop has 10 letters. [2025-01-10 07:01:55,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:55,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 41 letters. Loop has 20 letters. [2025-01-10 07:01:55,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:55,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1831 states and 3438 transitions. [2025-01-10 07:01:55,867 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 100 [2025-01-10 07:01:55,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1831 states to 1384 states and 2755 transitions. [2025-01-10 07:01:55,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2025-01-10 07:01:55,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 404 [2025-01-10 07:01:55,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1384 states and 2755 transitions. [2025-01-10 07:01:55,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:55,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1384 states and 2755 transitions. [2025-01-10 07:01:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states and 2755 transitions. [2025-01-10 07:01:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1210. [2025-01-10 07:01:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 804 states have (on average 1.2114427860696517) internal successors, (974), 879 states have internal predecessors, (974), 253 states have call successors, (259), 145 states have call predecessors, (259), 153 states have return successors, (1024), 185 states have call predecessors, (1024), 239 states have call successors, (1024) [2025-01-10 07:01:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2257 transitions. [2025-01-10 07:01:55,916 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1210 states and 2257 transitions. [2025-01-10 07:01:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:55,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:01:55,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:01:55,916 INFO L87 Difference]: Start difference. First operand 1210 states and 2257 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 07:01:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:56,004 INFO L93 Difference]: Finished difference Result 1419 states and 2535 transitions. [2025-01-10 07:01:56,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1419 states and 2535 transitions. [2025-01-10 07:01:56,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:56,010 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-01-10 07:01:56,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1419 states to 1373 states and 2475 transitions. [2025-01-10 07:01:56,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 389 [2025-01-10 07:01:56,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 389 [2025-01-10 07:01:56,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1373 states and 2475 transitions. [2025-01-10 07:01:56,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:56,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1373 states and 2475 transitions. [2025-01-10 07:01:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states and 2475 transitions. [2025-01-10 07:01:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1324. [2025-01-10 07:01:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 876 states have (on average 1.211187214611872) internal successors, (1061), 961 states have internal predecessors, (1061), 278 states have call successors, (286), 157 states have call predecessors, (286), 170 states have return successors, (1067), 205 states have call predecessors, (1067), 259 states have call successors, (1067) [2025-01-10 07:01:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2414 transitions. [2025-01-10 07:01:56,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1324 states and 2414 transitions. [2025-01-10 07:01:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:01:56,045 INFO L432 stractBuchiCegarLoop]: Abstraction has 1324 states and 2414 transitions. [2025-01-10 07:01:56,045 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-01-10 07:01:56,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1324 states and 2414 transitions. [2025-01-10 07:01:56,049 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 107 [2025-01-10 07:01:56,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:56,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:56,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:56,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:01:56,049 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" [2025-01-10 07:01:56,050 INFO L754 eck$LassoCheckResult]: Loop: "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" [2025-01-10 07:01:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -806968506, now seen corresponding path program 1 times [2025-01-10 07:01:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049836892] [2025-01-10 07:01:56,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 07:01:56,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 07:01:56,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 07:01:56,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049836892] [2025-01-10 07:01:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049836892] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096166070] [2025-01-10 07:01:56,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:56,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,114 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-01-10 07:01:56,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 07:01:56,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 07:01:56,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:56,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 07:01:56,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 07:01:56,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096166070] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:56,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:56,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-01-10 07:01:56,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660116152] [2025-01-10 07:01:56,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:56,202 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:01:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 43077918, now seen corresponding path program 2 times [2025-01-10 07:01:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4260828] [2025-01-10 07:01:56,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:56,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:56,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:56,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:56,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:56,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:56,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:56,275 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:56,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:56,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:56,275 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:56,275 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:56,275 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,275 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:56,275 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:56,275 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-01-10 07:01:56,275 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:56,275 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:56,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,323 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:56,323 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,327 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-01-10 07:01:56,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:56,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:56,342 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:56,342 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:56,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-01-10 07:01:56,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,355 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-01-10 07:01:56,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:56,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:56,367 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:56,367 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:01:56,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:56,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,377 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-01-10 07:01:56,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:56,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:56,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:56,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,409 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-01-10 07:01:56,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:56,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:56,702 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:56,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:56,712 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:56,712 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:56,712 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:56,712 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:56,712 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:56,712 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,712 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:56,712 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:56,712 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-01-10 07:01:56,712 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:56,712 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:56,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:56,776 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:56,776 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:56,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,778 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-01-10 07:01:56,781 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 [2025-01-10 07:01:56,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:56,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:56,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:56,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:56,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:56,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:56,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:56,795 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:56,798 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:01:56,798 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:01:56,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,800 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-01-10 07:01:56,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:56,802 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:56,802 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:56,802 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-01-10 07:01:56,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:56,808 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 07:01:56,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 07:01:56,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 07:01:56,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:57,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:57,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:57,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:57,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:57,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:01:57,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:57,142 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:01:57,142 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1324 states and 2414 transitions. cyclomatic complexity: 1135 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 07:01:57,309 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1324 states and 2414 transitions. cyclomatic complexity: 1135. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1394 states and 2494 transitions. Complement of second has 15 states. [2025-01-10 07:01:57,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-01-10 07:01:57,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 07:01:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2025-01-10 07:01:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 49 letters. Loop has 5 letters. [2025-01-10 07:01:57,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:57,311 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:01:57,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:57,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 07:01:57,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 07:01:57,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:57,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:57,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 07:01:57,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:57,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:57,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:57,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:57,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:57,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:01:57,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:57,543 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:01:57,543 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1324 states and 2414 transitions. cyclomatic complexity: 1135 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 07:01:57,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1324 states and 2414 transitions. cyclomatic complexity: 1135. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1394 states and 2494 transitions. Complement of second has 15 states. [2025-01-10 07:01:57,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 07:01:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2025-01-10 07:01:57,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 49 letters. Loop has 5 letters. [2025-01-10 07:01:57,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:57,622 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:01:57,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:57,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 07:01:57,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 07:01:57,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:57,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:57,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 07:01:57,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:57,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:57,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:57,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:57,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:57,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:01:57,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:57,844 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 4 loop predicates [2025-01-10 07:01:57,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1324 states and 2414 transitions. cyclomatic complexity: 1135 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 07:01:57,943 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1324 states and 2414 transitions. cyclomatic complexity: 1135. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 2055 states and 3487 transitions. Complement of second has 20 states. [2025-01-10 07:01:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 07:01:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2025-01-10 07:01:57,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 49 letters. Loop has 5 letters. [2025-01-10 07:01:57,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:57,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 54 letters. Loop has 5 letters. [2025-01-10 07:01:57,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:57,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 49 letters. Loop has 10 letters. [2025-01-10 07:01:57,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:57,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2055 states and 3487 transitions. [2025-01-10 07:01:57,958 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 107 [2025-01-10 07:01:57,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2055 states to 1628 states and 2980 transitions. [2025-01-10 07:01:57,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 353 [2025-01-10 07:01:57,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 395 [2025-01-10 07:01:57,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1628 states and 2980 transitions. [2025-01-10 07:01:57,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:57,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1628 states and 2980 transitions. [2025-01-10 07:01:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states and 2980 transitions. [2025-01-10 07:01:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1496. [2025-01-10 07:01:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 965 states have (on average 1.2424870466321243) internal successors, (1199), 1097 states have internal predecessors, (1199), 356 states have call successors, (364), 192 states have call predecessors, (364), 175 states have return successors, (1037), 206 states have call predecessors, (1037), 339 states have call successors, (1037) [2025-01-10 07:01:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2600 transitions. [2025-01-10 07:01:58,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1496 states and 2600 transitions. [2025-01-10 07:01:58,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:58,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:01:58,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:01:58,013 INFO L87 Difference]: Start difference. First operand 1496 states and 2600 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 07:01:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:58,095 INFO L93 Difference]: Finished difference Result 1514 states and 2602 transitions. [2025-01-10 07:01:58,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1514 states and 2602 transitions. [2025-01-10 07:01:58,102 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 101 [2025-01-10 07:01:58,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1514 states to 1496 states and 2582 transitions. [2025-01-10 07:01:58,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2025-01-10 07:01:58,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2025-01-10 07:01:58,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 2582 transitions. [2025-01-10 07:01:58,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:58,114 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1496 states and 2582 transitions. [2025-01-10 07:01:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 2582 transitions. [2025-01-10 07:01:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1462. [2025-01-10 07:01:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 943 states have (on average 1.23966065747614) internal successors, (1169), 1073 states have internal predecessors, (1169), 346 states have call successors, (352), 188 states have call predecessors, (352), 173 states have return successors, (1018), 200 states have call predecessors, (1018), 333 states have call successors, (1018) [2025-01-10 07:01:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2539 transitions. [2025-01-10 07:01:58,143 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1462 states and 2539 transitions. [2025-01-10 07:01:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:01:58,144 INFO L432 stractBuchiCegarLoop]: Abstraction has 1462 states and 2539 transitions. [2025-01-10 07:01:58,144 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-01-10 07:01:58,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1462 states and 2539 transitions. [2025-01-10 07:01:58,161 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 99 [2025-01-10 07:01:58,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:58,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:58,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 6, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:01:58,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:01:58,162 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-01-10 07:01:58,162 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-01-10 07:01:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -828026204, now seen corresponding path program 1 times [2025-01-10 07:01:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934324849] [2025-01-10 07:01:58,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:58,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 07:01:58,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 07:01:58,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:58,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-10 07:01:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934324849] [2025-01-10 07:01:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934324849] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833366835] [2025-01-10 07:01:58,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:58,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:58,288 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:58,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-01-10 07:01:58,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 07:01:58,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 07:01:58,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:58,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:58,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:01:58,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-10 07:01:58,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-10 07:01:58,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833366835] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:58,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:58,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-01-10 07:01:58,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775606275] [2025-01-10 07:01:58,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:58,458 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:01:58,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash 75732828, now seen corresponding path program 3 times [2025-01-10 07:01:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773647497] [2025-01-10 07:01:58,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:58,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:58,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:58,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:01:58,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:58,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:58,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:58,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:58,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:58,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:58,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:58,536 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:58,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:58,536 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:58,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:58,536 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:58,537 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:58,537 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:58,537 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:58,537 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-01-10 07:01:58,537 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:58,537 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:58,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,584 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:58,585 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:58,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:58,586 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:58,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-01-10 07:01:58,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:58,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:58,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:58,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:58,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:58,615 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:58,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-01-10 07:01:58,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:58,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:58,895 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:58,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:58,905 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:58,905 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:58,905 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:58,905 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:58,905 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:58,905 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:58,905 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:58,905 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:58,905 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-01-10 07:01:58,905 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:58,905 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:58,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:58,951 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:58,951 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:58,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:58,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:58,953 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:58,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-01-10 07:01:58,956 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 [2025-01-10 07:01:58,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:58,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:58,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:58,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:58,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:58,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:58,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:58,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:58,975 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:01:58,975 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:01:58,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:58,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:58,978 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:58,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-01-10 07:01:58,979 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:58,979 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:58,979 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:58,979 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-01-10 07:01:58,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:58,985 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:58,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:59,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 07:01:59,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 07:01:59,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:59,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:59,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 07:01:59,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:59,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:59,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:59,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:59,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:59,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:01:59,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:59,410 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-01-10 07:01:59,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1462 states and 2539 transitions. cyclomatic complexity: 1118 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:59,489 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1462 states and 2539 transitions. cyclomatic complexity: 1118. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1700 states and 2895 transitions. Complement of second has 28 states. [2025-01-10 07:01:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2025-01-10 07:01:59,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 61 letters. Loop has 5 letters. [2025-01-10 07:01:59,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:59,490 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:01:59,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:59,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 07:01:59,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 07:01:59,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:59,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:59,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 07:01:59,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:59,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:59,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:59,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:59,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:59,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:01:59,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:59,799 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2025-01-10 07:01:59,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1462 states and 2539 transitions. cyclomatic complexity: 1118 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:59,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-01-10 07:01:59,926 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1462 states and 2539 transitions. cyclomatic complexity: 1118. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1615 states and 2746 transitions. Complement of second has 23 states. [2025-01-10 07:01:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2025-01-10 07:01:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:01:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2025-01-10 07:01:59,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 29 transitions. Stem has 61 letters. Loop has 5 letters. [2025-01-10 07:01:59,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:59,928 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:01:59,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:59,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 07:01:59,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 07:01:59,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:59,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:59,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 07:01:59,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:00,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:00,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:00,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:00,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:02:00,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:00,206 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 5 loop predicates [2025-01-10 07:02:00,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1462 states and 2539 transitions. cyclomatic complexity: 1118 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:02:00,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1462 states and 2539 transitions. cyclomatic complexity: 1118. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 3293 states and 5259 transitions. Complement of second has 40 states. [2025-01-10 07:02:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:02:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-01-10 07:02:00,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 61 letters. Loop has 5 letters. [2025-01-10 07:02:00,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:00,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 66 letters. Loop has 5 letters. [2025-01-10 07:02:00,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:00,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 61 letters. Loop has 10 letters. [2025-01-10 07:02:00,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:00,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3293 states and 5259 transitions. [2025-01-10 07:02:00,309 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 144 [2025-01-10 07:02:00,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3293 states to 1926 states and 3682 transitions. [2025-01-10 07:02:00,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 438 [2025-01-10 07:02:00,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 446 [2025-01-10 07:02:00,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1926 states and 3682 transitions. [2025-01-10 07:02:00,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:00,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1926 states and 3682 transitions. [2025-01-10 07:02:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states and 3682 transitions. [2025-01-10 07:02:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1580. [2025-01-10 07:02:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1025 states have (on average 1.233170731707317) internal successors, (1264), 1172 states have internal predecessors, (1264), 351 states have call successors, (357), 207 states have call predecessors, (357), 204 states have return successors, (1022), 200 states have call predecessors, (1022), 338 states have call successors, (1022) [2025-01-10 07:02:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2643 transitions. [2025-01-10 07:02:00,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1580 states and 2643 transitions. [2025-01-10 07:02:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:00,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 07:02:00,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-10 07:02:00,381 INFO L87 Difference]: Start difference. First operand 1580 states and 2643 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-10 07:02:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:00,437 INFO L93 Difference]: Finished difference Result 1623 states and 2721 transitions. [2025-01-10 07:02:00,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1623 states and 2721 transitions. [2025-01-10 07:02:00,444 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2025-01-10 07:02:00,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1623 states to 1609 states and 2704 transitions. [2025-01-10 07:02:00,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2025-01-10 07:02:00,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2025-01-10 07:02:00,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1609 states and 2704 transitions. [2025-01-10 07:02:00,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:00,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1609 states and 2704 transitions. [2025-01-10 07:02:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states and 2704 transitions. [2025-01-10 07:02:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1583. [2025-01-10 07:02:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1027 states have (on average 1.2327166504381695) internal successors, (1266), 1174 states have internal predecessors, (1266), 352 states have call successors, (358), 207 states have call predecessors, (358), 204 states have return successors, (1023), 201 states have call predecessors, (1023), 339 states have call successors, (1023) [2025-01-10 07:02:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2647 transitions. [2025-01-10 07:02:00,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1583 states and 2647 transitions. [2025-01-10 07:02:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 07:02:00,485 INFO L432 stractBuchiCegarLoop]: Abstraction has 1583 states and 2647 transitions. [2025-01-10 07:02:00,485 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-01-10 07:02:00,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1583 states and 2647 transitions. [2025-01-10 07:02:00,488 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 99 [2025-01-10 07:02:00,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:00,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:00,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 6, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:02:00,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:02:00,489 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-01-10 07:02:00,489 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-01-10 07:02:00,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:00,489 INFO L85 PathProgramCache]: Analyzing trace with hash 423703550, now seen corresponding path program 2 times [2025-01-10 07:02:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:00,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844158118] [2025-01-10 07:02:00,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:00,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:00,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-01-10 07:02:00,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 07:02:00,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:00,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-10 07:02:00,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:00,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844158118] [2025-01-10 07:02:00,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844158118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:00,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744287400] [2025-01-10 07:02:00,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:00,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:00,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:00,625 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:00,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-01-10 07:02:00,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-01-10 07:02:00,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 07:02:00,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:00,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:00,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:02:00,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-10 07:02:00,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-10 07:02:00,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744287400] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:00,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:00,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-01-10 07:02:00,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728967818] [2025-01-10 07:02:00,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:00,907 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:02:00,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash 75732828, now seen corresponding path program 4 times [2025-01-10 07:02:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:00,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346454227] [2025-01-10 07:02:00,907 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:00,909 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-01-10 07:02:00,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:00,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:00,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:00,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:00,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:00,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:00,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:00,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:00,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:00,973 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:00,973 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:00,973 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:00,973 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:00,973 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:00,973 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:00,973 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:00,973 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:00,974 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2025-01-10 07:02:00,974 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:00,974 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:00,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:00,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:00,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:00,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:00,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:01,021 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:01,021 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:01,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:01,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:01,024 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:01,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-01-10 07:02:01,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:01,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:01,037 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:01,037 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:01,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:01,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:01,045 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:01,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-01-10 07:02:01,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:01,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:01,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-01-10 07:02:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:01,075 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:01,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-01-10 07:02:01,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:01,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:01,400 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:01,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:01,410 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:01,410 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:01,410 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:01,410 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:01,410 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:01,410 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:01,410 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:01,410 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:01,410 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2025-01-10 07:02:01,410 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:01,410 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:01,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:01,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:01,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:01,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:01,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:01,451 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:01,451 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:01,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:01,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:01,456 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:01,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-01-10 07:02:01,458 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 [2025-01-10 07:02:01,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:01,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:01,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:01,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:01,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:01,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:01,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:01,472 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:01,476 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:01,476 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:01,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:01,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:01,478 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:01,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-01-10 07:02:01,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:01,480 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:01,480 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:01,480 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-01-10 07:02:01,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-01-10 07:02:01,487 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:01,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:01,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 07:02:01,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 07:02:01,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:01,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:01,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:02:01,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:01,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:01,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:01,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:01,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:01,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:02:01,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:01,829 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-01-10 07:02:01,829 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1583 states and 2647 transitions. cyclomatic complexity: 1105 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:02:01,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1583 states and 2647 transitions. cyclomatic complexity: 1105. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1826 states and 3008 transitions. Complement of second has 28 states. [2025-01-10 07:02:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:02:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2025-01-10 07:02:01,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 68 letters. Loop has 5 letters. [2025-01-10 07:02:01,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:01,908 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:01,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:01,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 07:02:01,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 07:02:01,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:01,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:01,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:02:01,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:02,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-01-10 07:02:02,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:02,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:02,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:02,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:02:02,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:02,360 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2025-01-10 07:02:02,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1583 states and 2647 transitions. cyclomatic complexity: 1105 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:02:02,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1583 states and 2647 transitions. cyclomatic complexity: 1105. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1741 states and 2859 transitions. Complement of second has 23 states. [2025-01-10 07:02:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:02:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2025-01-10 07:02:02,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 29 transitions. Stem has 68 letters. Loop has 5 letters. [2025-01-10 07:02:02,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:02,482 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:02,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:02,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 07:02:02,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 07:02:02,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:02,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:02,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:02:02,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:02,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:02,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:02,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:02,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:02,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:02:02,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:02,853 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 5 loop predicates [2025-01-10 07:02:02,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1583 states and 2647 transitions. cyclomatic complexity: 1105 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:02:02,998 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1583 states and 2647 transitions. cyclomatic complexity: 1105. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 3281 states and 5244 transitions. Complement of second has 40 states. [2025-01-10 07:02:03,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:02:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-01-10 07:02:03,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 68 letters. Loop has 5 letters. [2025-01-10 07:02:03,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:03,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 73 letters. Loop has 5 letters. [2025-01-10 07:02:03,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:03,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 68 letters. Loop has 10 letters. [2025-01-10 07:02:03,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:03,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3281 states and 5244 transitions. [2025-01-10 07:02:03,032 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 144 [2025-01-10 07:02:03,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3281 states to 1922 states and 3678 transitions. [2025-01-10 07:02:03,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2025-01-10 07:02:03,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 441 [2025-01-10 07:02:03,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1922 states and 3678 transitions. [2025-01-10 07:02:03,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:03,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1922 states and 3678 transitions. [2025-01-10 07:02:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states and 3678 transitions. [2025-01-10 07:02:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1583. [2025-01-10 07:02:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1027 states have (on average 1.2327166504381695) internal successors, (1266), 1174 states have internal predecessors, (1266), 352 states have call successors, (358), 207 states have call predecessors, (358), 204 states have return successors, (1023), 201 states have call predecessors, (1023), 339 states have call successors, (1023) [2025-01-10 07:02:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2647 transitions. [2025-01-10 07:02:03,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1583 states and 2647 transitions. [2025-01-10 07:02:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:03,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 07:02:03,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-10 07:02:03,153 INFO L87 Difference]: Start difference. First operand 1583 states and 2647 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 9 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-10 07:02:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:03,368 INFO L93 Difference]: Finished difference Result 1277 states and 2004 transitions. [2025-01-10 07:02:03,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1277 states and 2004 transitions. [2025-01-10 07:02:03,381 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 84 [2025-01-10 07:02:03,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1277 states to 1277 states and 2004 transitions. [2025-01-10 07:02:03,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2025-01-10 07:02:03,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2025-01-10 07:02:03,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1277 states and 2004 transitions. [2025-01-10 07:02:03,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:03,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1277 states and 2004 transitions. [2025-01-10 07:02:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states and 2004 transitions. [2025-01-10 07:02:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1270. [2025-01-10 07:02:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 832 states have (on average 1.2103365384615385) internal successors, (1007), 945 states have internal predecessors, (1007), 277 states have call successors, (284), 165 states have call predecessors, (284), 161 states have return successors, (704), 159 states have call predecessors, (704), 268 states have call successors, (704) [2025-01-10 07:02:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1995 transitions. [2025-01-10 07:02:03,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1270 states and 1995 transitions. [2025-01-10 07:02:03,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 07:02:03,433 INFO L432 stractBuchiCegarLoop]: Abstraction has 1270 states and 1995 transitions. [2025-01-10 07:02:03,433 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-01-10 07:02:03,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1270 states and 1995 transitions. [2025-01-10 07:02:03,436 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 84 [2025-01-10 07:02:03,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:03,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:03,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 8, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:02:03,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 07:02:03,442 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" [2025-01-10 07:02:03,442 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" [2025-01-10 07:02:03,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1685889895, now seen corresponding path program 1 times [2025-01-10 07:02:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415355853] [2025-01-10 07:02:03,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:03,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 07:02:03,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:02:03,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:03,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 07:02:03,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:02:03,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:03,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1541106535, now seen corresponding path program 2 times [2025-01-10 07:02:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739602498] [2025-01-10 07:02:03,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:03,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 07:02:03,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:02:03,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:03,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:03,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:02:03,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:02:03,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:03,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1936100095, now seen corresponding path program 2 times [2025-01-10 07:02:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:03,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574106027] [2025-01-10 07:02:03,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:03,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-01-10 07:02:03,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 07:02:03,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:03,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 46 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-10 07:02:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574106027] [2025-01-10 07:02:03,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574106027] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466308484] [2025-01-10 07:02:03,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:03,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:03,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:03,708 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:03,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-01-10 07:02:03,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-01-10 07:02:03,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 07:02:03,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:03,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:03,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:02:03,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 136 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-01-10 07:02:03,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 98 proven. 47 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 07:02:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466308484] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:03,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:03,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 10 [2025-01-10 07:02:03,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585746832] [2025-01-10 07:02:03,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:04,345 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:04,345 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:04,345 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:04,345 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:04,345 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:04,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:04,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:04,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2025-01-10 07:02:04,345 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:04,345 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:04,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,453 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:04,453 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:04,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,455 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-01-10 07:02:04,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:04,458 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:04,472 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:04,472 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=1} Honda state: {parts_#t~ret1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:04,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:04,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,480 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:04,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:04,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-01-10 07:02:04,497 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:04,497 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:04,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:04,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,504 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-01-10 07:02:04,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:04,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:04,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:04,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,535 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-01-10 07:02:04,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:04,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:04,839 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:04,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:04,848 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:04,849 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:04,849 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:04,849 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:04,849 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:04,849 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,849 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:04,849 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:04,849 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2025-01-10 07:02:04,849 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:04,849 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:04,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,929 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:04,929 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:04,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,936 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-01-10 07:02:04,941 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 [2025-01-10 07:02:04,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:04,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:04,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:04,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:04,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:04,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:04,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:04,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:04,959 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:04,959 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:04,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,961 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-01-10 07:02:04,963 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:04,963 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:04,963 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:04,963 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2025-01-10 07:02:04,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:04,969 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:04,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 07:02:05,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:02:05,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:05,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:05,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 07:02:05,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:05,199 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Exception during sending of exit command (exit): Broken pipe [2025-01-10 07:02:05,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-01-10 07:02:05,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:02:05,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:02:05,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:05,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:02:05,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:05,508 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 [2025-01-10 07:02:05,508 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1270 states and 1995 transitions. cyclomatic complexity: 756 Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:02:05,727 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1270 states and 1995 transitions. cyclomatic complexity: 756. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 2994 states and 4896 transitions. Complement of second has 28 states. [2025-01-10 07:02:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:02:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2025-01-10 07:02:05,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 73 letters. Loop has 15 letters. [2025-01-10 07:02:05,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:05,730 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:05,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:05,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 07:02:05,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:02:05,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:05,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:05,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 07:02:05,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:06,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:02:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:02:06,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:06,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:06,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:02:06,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:06,175 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 [2025-01-10 07:02:06,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1270 states and 1995 transitions. cyclomatic complexity: 756 Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:02:06,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1270 states and 1995 transitions. cyclomatic complexity: 756. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 2077 states and 3214 transitions. Complement of second has 32 states. [2025-01-10 07:02:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:02:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2025-01-10 07:02:06,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 61 transitions. Stem has 73 letters. Loop has 15 letters. [2025-01-10 07:02:06,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:06,406 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:06,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:06,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 07:02:06,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:02:06,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:06,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:06,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 07:02:06,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:06,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:02:06,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:02:06,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:06,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:06,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:02:06,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:06,794 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 [2025-01-10 07:02:06,794 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1270 states and 1995 transitions. cyclomatic complexity: 756 Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:02:07,057 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1270 states and 1995 transitions. cyclomatic complexity: 756. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 6832 states and 11789 transitions. Complement of second has 110 states. [2025-01-10 07:02:07,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:02:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-01-10 07:02:07,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 57 transitions. Stem has 73 letters. Loop has 15 letters. [2025-01-10 07:02:07,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:07,058 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:07,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:07,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 07:02:07,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:02:07,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:07,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:07,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 07:02:07,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:07,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:02:07,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:02:07,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:07,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:07,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:02:07,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:07,442 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2025-01-10 07:02:07,442 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1270 states and 1995 transitions. cyclomatic complexity: 756 Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:02:07,645 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1270 states and 1995 transitions. cyclomatic complexity: 756. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 5419 states and 8759 transitions. Complement of second has 97 states. [2025-01-10 07:02:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:02:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2025-01-10 07:02:07,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 67 transitions. Stem has 73 letters. Loop has 15 letters. [2025-01-10 07:02:07,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:07,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 67 transitions. Stem has 88 letters. Loop has 15 letters. [2025-01-10 07:02:07,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:07,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 67 transitions. Stem has 73 letters. Loop has 30 letters. [2025-01-10 07:02:07,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:07,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5419 states and 8759 transitions. [2025-01-10 07:02:07,671 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 136 [2025-01-10 07:02:07,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5419 states to 2710 states and 4737 transitions. [2025-01-10 07:02:07,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 414 [2025-01-10 07:02:07,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 499 [2025-01-10 07:02:07,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2710 states and 4737 transitions. [2025-01-10 07:02:07,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:07,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2710 states and 4737 transitions. [2025-01-10 07:02:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states and 4737 transitions. [2025-01-10 07:02:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2162. [2025-01-10 07:02:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2162 states, 1404 states have (on average 1.1695156695156694) internal successors, (1642), 1575 states have internal predecessors, (1642), 456 states have call successors, (511), 266 states have call predecessors, (511), 302 states have return successors, (1464), 320 states have call predecessors, (1464), 446 states have call successors, (1464) [2025-01-10 07:02:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 3617 transitions. [2025-01-10 07:02:07,732 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2162 states and 3617 transitions. [2025-01-10 07:02:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:07,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 07:02:07,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 07:02:07,732 INFO L87 Difference]: Start difference. First operand 2162 states and 3617 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 07:02:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:07,919 INFO L93 Difference]: Finished difference Result 1182 states and 1659 transitions. [2025-01-10 07:02:07,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1182 states and 1659 transitions. [2025-01-10 07:02:07,923 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 94 [2025-01-10 07:02:07,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1182 states to 997 states and 1448 transitions. [2025-01-10 07:02:07,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-01-10 07:02:07,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2025-01-10 07:02:07,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 997 states and 1448 transitions. [2025-01-10 07:02:07,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:07,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 997 states and 1448 transitions. [2025-01-10 07:02:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states and 1448 transitions. [2025-01-10 07:02:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 925. [2025-01-10 07:02:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 605 states have (on average 1.1289256198347108) internal successors, (683), 662 states have internal predecessors, (683), 169 states have call successors, (194), 98 states have call predecessors, (194), 151 states have return successors, (480), 164 states have call predecessors, (480), 164 states have call successors, (480) [2025-01-10 07:02:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1357 transitions. [2025-01-10 07:02:07,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 925 states and 1357 transitions. [2025-01-10 07:02:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 07:02:07,967 INFO L432 stractBuchiCegarLoop]: Abstraction has 925 states and 1357 transitions. [2025-01-10 07:02:07,967 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-01-10 07:02:07,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 925 states and 1357 transitions. [2025-01-10 07:02:07,968 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 94 [2025-01-10 07:02:07,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:07,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:07,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 7, 7, 6, 6, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:02:07,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 07:02:07,969 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#50#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< [2025-01-10 07:02:07,969 INFO L754 eck$LassoCheckResult]: Loop: "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< [2025-01-10 07:02:07,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1864883014, now seen corresponding path program 1 times [2025-01-10 07:02:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:07,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219840422] [2025-01-10 07:02:07,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 07:02:07,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 07:02:07,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:07,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-10 07:02:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219840422] [2025-01-10 07:02:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219840422] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302988765] [2025-01-10 07:02:08,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:08,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:08,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,019 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-01-10 07:02:08,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 07:02:08,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 07:02:08,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:08,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:08,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:02:08,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-10 07:02:08,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:02:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302988765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:02:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:02:08,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-01-10 07:02:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33682668] [2025-01-10 07:02:08,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:02:08,079 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:02:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1621109762, now seen corresponding path program 1 times [2025-01-10 07:02:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884129046] [2025-01-10 07:02:08,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:08,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:08,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:08,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:08,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:08,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:08,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:08,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:08,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:08,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:08,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:08,280 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:08,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:08,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:08,280 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:08,280 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:08,280 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,280 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:08,280 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:08,280 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2025-01-10 07:02:08,280 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:08,280 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:08,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,347 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:08,347 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:08,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,349 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-01-10 07:02:08,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:08,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:08,375 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:08,375 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:08,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,394 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-01-10 07:02:08,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:08,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:08,417 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:08,417 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:08,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,428 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-01-10 07:02:08,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:08,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:08,452 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:08,452 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:08,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,465 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:08,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:08,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-01-10 07:02:08,482 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:08,482 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:08,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,491 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-01-10 07:02:08,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:08,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:08,521 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:08,521 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:08,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-01-10 07:02:08,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,533 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-01-10 07:02:08,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:08,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:08,556 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:08,556 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:08,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,572 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-01-10 07:02:08,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:08,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:08,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-01-10 07:02:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,611 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-01-10 07:02:08,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:08,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:08,774 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:08,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,781 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:08,781 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:08,781 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:08,781 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:08,782 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:08,782 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,782 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:08,782 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:08,782 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2025-01-10 07:02:08,782 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:08,782 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:08,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:08,864 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:08,865 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:08,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,867 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-01-10 07:02:08,869 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 [2025-01-10 07:02:08,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:08,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:08,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:08,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:08,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:08,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:08,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:08,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:08,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,890 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-01-10 07:02:08,892 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 [2025-01-10 07:02:08,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:08,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:08,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:08,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:08,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:08,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:08,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:08,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:08,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,912 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-01-10 07:02:08,918 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 [2025-01-10 07:02:08,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:08,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:08,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:08,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:08,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:08,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:08,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:08,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:08,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,940 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-01-10 07:02:08,943 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 [2025-01-10 07:02:08,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:08,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:08,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:08,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:08,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:08,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:08,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:08,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:08,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,966 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-01-10 07:02:08,967 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 [2025-01-10 07:02:08,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:08,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:08,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:08,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:08,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:08,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:08,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:08,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:08,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:08,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:08,987 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:08,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-01-10 07:02:08,989 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 [2025-01-10 07:02:08,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:08,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:08,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:08,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:08,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:09,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:09,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:09,002 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:09,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:09,005 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:09,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:09,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:09,008 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:09,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-01-10 07:02:09,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:09,009 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:09,009 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:09,009 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-01-10 07:02:09,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:09,015 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:09,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:09,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 07:02:09,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 07:02:09,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:09,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:09,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:02:09,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:09,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:09,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:09,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:09,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:09,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:02:09,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:02:09,563 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:02:09,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 925 states and 1357 transitions. cyclomatic complexity: 448 Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:02:09,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 925 states and 1357 transitions. cyclomatic complexity: 448. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1030 states and 1475 transitions. Complement of second has 32 states. [2025-01-10 07:02:09,638 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 [2025-01-10 07:02:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:02:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-01-10 07:02:09,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 80 letters. Loop has 10 letters. [2025-01-10 07:02:09,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:09,639 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:09,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:09,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 07:02:09,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 07:02:09,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:09,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:09,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:02:09,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:10,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:10,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:10,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:10,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:10,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:10,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:02:10,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:02:10,257 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:02:10,258 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 925 states and 1357 transitions. cyclomatic complexity: 448 Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:02:10,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 925 states and 1357 transitions. cyclomatic complexity: 448. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1030 states and 1475 transitions. Complement of second has 32 states. [2025-01-10 07:02:10,342 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 [2025-01-10 07:02:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:02:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-01-10 07:02:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 80 letters. Loop has 10 letters. [2025-01-10 07:02:10,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:10,342 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:10,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:10,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 07:02:10,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 07:02:10,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:10,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:10,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:02:10,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:10,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:10,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:10,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:10,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:10,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:02:10,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:02:10,687 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 4 loop predicates [2025-01-10 07:02:10,687 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 925 states and 1357 transitions. cyclomatic complexity: 448 Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:02:10,778 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 925 states and 1357 transitions. cyclomatic complexity: 448. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1838 states and 2917 transitions. Complement of second has 36 states. [2025-01-10 07:02:10,779 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 [2025-01-10 07:02:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:02:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2025-01-10 07:02:10,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 80 letters. Loop has 10 letters. [2025-01-10 07:02:10,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:10,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 90 letters. Loop has 10 letters. [2025-01-10 07:02:10,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:10,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 80 letters. Loop has 20 letters. [2025-01-10 07:02:10,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:10,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1838 states and 2917 transitions. [2025-01-10 07:02:10,789 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 148 [2025-01-10 07:02:10,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1838 states to 1553 states and 2548 transitions. [2025-01-10 07:02:10,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2025-01-10 07:02:10,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2025-01-10 07:02:10,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1553 states and 2548 transitions. [2025-01-10 07:02:10,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:10,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1553 states and 2548 transitions. [2025-01-10 07:02:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states and 2548 transitions. [2025-01-10 07:02:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1266. [2025-01-10 07:02:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 823 states have (on average 1.157958687727825) internal successors, (953), 909 states have internal predecessors, (953), 253 states have call successors, (289), 148 states have call predecessors, (289), 190 states have return successors, (779), 208 states have call predecessors, (779), 244 states have call successors, (779) [2025-01-10 07:02:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 2021 transitions. [2025-01-10 07:02:10,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1266 states and 2021 transitions. [2025-01-10 07:02:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:10,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:02:10,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:02:10,818 INFO L87 Difference]: Start difference. First operand 1266 states and 2021 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 07:02:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:10,871 INFO L93 Difference]: Finished difference Result 1298 states and 2055 transitions. [2025-01-10 07:02:10,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1298 states and 2055 transitions. [2025-01-10 07:02:10,875 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 119 [2025-01-10 07:02:10,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1298 states to 1253 states and 1997 transitions. [2025-01-10 07:02:10,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2025-01-10 07:02:10,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2025-01-10 07:02:10,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1253 states and 1997 transitions. [2025-01-10 07:02:10,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:10,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1253 states and 1997 transitions. [2025-01-10 07:02:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states and 1997 transitions. [2025-01-10 07:02:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1251. [2025-01-10 07:02:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 813 states have (on average 1.1488314883148831) internal successors, (934), 895 states have internal predecessors, (934), 252 states have call successors, (288), 148 states have call predecessors, (288), 186 states have return successors, (772), 207 states have call predecessors, (772), 243 states have call successors, (772) [2025-01-10 07:02:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1994 transitions. [2025-01-10 07:02:10,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1251 states and 1994 transitions. [2025-01-10 07:02:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:02:10,896 INFO L432 stractBuchiCegarLoop]: Abstraction has 1251 states and 1994 transitions. [2025-01-10 07:02:10,896 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-01-10 07:02:10,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1251 states and 1994 transitions. [2025-01-10 07:02:10,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 119 [2025-01-10 07:02:10,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:10,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:10,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:02:10,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 07:02:10,899 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#50#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#56#return;" [2025-01-10 07:02:10,900 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#50#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#56#return;" [2025-01-10 07:02:10,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash 485550093, now seen corresponding path program 2 times [2025-01-10 07:02:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854450094] [2025-01-10 07:02:10,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:10,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-01-10 07:02:10,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 07:02:10,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:10,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:10,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 07:02:10,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 07:02:10,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:10,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:10,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:10,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash -854569734, now seen corresponding path program 1 times [2025-01-10 07:02:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658032701] [2025-01-10 07:02:10,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:10,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 07:02:10,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 07:02:10,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:10,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:10,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:10,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 07:02:10,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 07:02:10,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:10,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:10,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:10,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1191658746, now seen corresponding path program 3 times [2025-01-10 07:02:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:10,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274242932] [2025-01-10 07:02:10,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:10,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 145 statements into 9 equivalence classes. [2025-01-10 07:02:10,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 104 of 145 statements. [2025-01-10 07:02:10,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 07:02:10,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 312 proven. 52 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-01-10 07:02:11,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:11,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274242932] [2025-01-10 07:02:11,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274242932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:11,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013021043] [2025-01-10 07:02:11,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:11,147 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:11,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-01-10 07:02:11,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 145 statements into 9 equivalence classes. [2025-01-10 07:02:11,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 104 of 145 statements. [2025-01-10 07:02:11,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 07:02:11,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:11,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:02:11,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 472 proven. 32 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-01-10 07:02:11,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 183 proven. 86 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2025-01-10 07:02:11,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013021043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:11,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:11,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2025-01-10 07:02:11,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061452470] [2025-01-10 07:02:11,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:12,076 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:12,076 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:12,076 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:12,076 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:12,076 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:12,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:12,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:12,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:12,076 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2025-01-10 07:02:12,076 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:12,077 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:12,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:12,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:12,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:12,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:12,108 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:12,108 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:12,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:12,110 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:12,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-01-10 07:02:12,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:12,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:12,123 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:12,124 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:12,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:12,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:12,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:12,131 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:12,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-01-10 07:02:12,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:12,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:12,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-01-10 07:02:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:12,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:12,155 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:12,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-01-10 07:02:12,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:12,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:12,169 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:12,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-01-10 07:02:12,174 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:12,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:12,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:12,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:12,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:12,175 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:12,175 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:12,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:12,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2025-01-10 07:02:12,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:12,175 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:12,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:12,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:12,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:12,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:12,209 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:12,209 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:12,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:12,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:12,211 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:12,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-01-10 07:02:12,213 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 [2025-01-10 07:02:12,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:12,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:12,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:12,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:12,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:12,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:12,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:12,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:12,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-01-10 07:02:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:12,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:12,233 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-01-10 07:02:12,235 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 [2025-01-10 07:02:12,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:12,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:12,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:12,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:12,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:12,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:12,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:12,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:12,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:12,249 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:12,251 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:12,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-01-10 07:02:12,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:12,253 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:12,253 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:12,253 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2025-01-10 07:02:12,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:12,259 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:12,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 07:02:12,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 07:02:12,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:12,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:12,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:02:12,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:12,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-01-10 07:02:12,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 07:02:12,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 07:02:12,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:12,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:12,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 07:02:12,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 14 proven. 47 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 07:02:12,911 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 [2025-01-10 07:02:12,912 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1251 states and 1994 transitions. cyclomatic complexity: 764 Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-01-10 07:02:13,198 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1251 states and 1994 transitions. cyclomatic complexity: 764. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) Result 3644 states and 6551 transitions. Complement of second has 69 states. [2025-01-10 07:02:13,202 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 [2025-01-10 07:02:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-01-10 07:02:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2025-01-10 07:02:13,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 77 transitions. Stem has 85 letters. Loop has 60 letters. [2025-01-10 07:02:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:13,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 77 transitions. Stem has 145 letters. Loop has 60 letters. [2025-01-10 07:02:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:13,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 77 transitions. Stem has 85 letters. Loop has 120 letters. [2025-01-10 07:02:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:13,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3644 states and 6551 transitions. [2025-01-10 07:02:13,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 173 [2025-01-10 07:02:13,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3644 states to 3211 states and 5801 transitions. [2025-01-10 07:02:13,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 405 [2025-01-10 07:02:13,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 405 [2025-01-10 07:02:13,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3211 states and 5801 transitions. [2025-01-10 07:02:13,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:13,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3211 states and 5801 transitions. [2025-01-10 07:02:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states and 5801 transitions. [2025-01-10 07:02:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 2873. [2025-01-10 07:02:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 1810 states have (on average 1.1298342541436464) internal successors, (2045), 2003 states have internal predecessors, (2045), 609 states have call successors, (722), 302 states have call predecessors, (722), 454 states have return successors, (2096), 567 states have call predecessors, (2096), 599 states have call successors, (2096) [2025-01-10 07:02:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 4863 transitions. [2025-01-10 07:02:13,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2873 states and 4863 transitions. [2025-01-10 07:02:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:13,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 07:02:13,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-01-10 07:02:13,387 INFO L87 Difference]: Start difference. First operand 2873 states and 4863 transitions. Second operand has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 13 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2025-01-10 07:02:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:14,027 INFO L93 Difference]: Finished difference Result 2960 states and 5173 transitions. [2025-01-10 07:02:14,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2960 states and 5173 transitions. [2025-01-10 07:02:14,043 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2025-01-10 07:02:14,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2960 states to 1602 states and 2787 transitions. [2025-01-10 07:02:14,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 347 [2025-01-10 07:02:14,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 347 [2025-01-10 07:02:14,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1602 states and 2787 transitions. [2025-01-10 07:02:14,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:14,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1602 states and 2787 transitions. [2025-01-10 07:02:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states and 2787 transitions. [2025-01-10 07:02:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1444. [2025-01-10 07:02:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 923 states have (on average 1.113759479956663) internal successors, (1028), 1008 states have internal predecessors, (1028), 282 states have call successors, (341), 156 states have call predecessors, (341), 239 states have return successors, (1027), 279 states have call predecessors, (1027), 273 states have call successors, (1027) [2025-01-10 07:02:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2396 transitions. [2025-01-10 07:02:14,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1444 states and 2396 transitions. [2025-01-10 07:02:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 07:02:14,081 INFO L432 stractBuchiCegarLoop]: Abstraction has 1444 states and 2396 transitions. [2025-01-10 07:02:14,081 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-01-10 07:02:14,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1444 states and 2396 transitions. [2025-01-10 07:02:14,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 116 [2025-01-10 07:02:14,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:14,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:14,086 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:02:14,086 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [23, 23, 18, 11, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1] [2025-01-10 07:02:14,086 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#50#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#56#return;" [2025-01-10 07:02:14,086 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#50#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#56#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#50#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#54#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#50#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#56#return;" [2025-01-10 07:02:14,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash 485550093, now seen corresponding path program 4 times [2025-01-10 07:02:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:14,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526261502] [2025-01-10 07:02:14,087 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:14,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:14,091 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-01-10 07:02:14,096 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 07:02:14,099 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:14,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:14,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:14,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 07:02:14,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 07:02:14,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:14,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:14,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:14,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 723474714, now seen corresponding path program 2 times [2025-01-10 07:02:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:14,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898736945] [2025-01-10 07:02:14,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:14,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes. [2025-01-10 07:02:14,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 07:02:14,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:14,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 140 proven. 181 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2025-01-10 07:02:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:14,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898736945] [2025-01-10 07:02:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898736945] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:14,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754662745] [2025-01-10 07:02:14,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:14,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:14,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:14,270 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:14,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-01-10 07:02:14,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes. [2025-01-10 07:02:14,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 07:02:14,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:14,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:14,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:02:14,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 804 proven. 38 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-10 07:02:14,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 140 proven. 186 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2025-01-10 07:02:14,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754662745] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:14,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:14,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 13 [2025-01-10 07:02:14,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093666638] [2025-01-10 07:02:14,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:14,912 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:02:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:14,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:02:14,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:02:14,912 INFO L87 Difference]: Start difference. First operand 1444 states and 2396 transitions. cyclomatic complexity: 970 Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 9 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2025-01-10 07:02:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:15,079 INFO L93 Difference]: Finished difference Result 1760 states and 3746 transitions. [2025-01-10 07:02:15,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1760 states and 3746 transitions. [2025-01-10 07:02:15,093 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 125 [2025-01-10 07:02:15,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1760 states to 1760 states and 3746 transitions. [2025-01-10 07:02:15,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2025-01-10 07:02:15,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2025-01-10 07:02:15,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1760 states and 3746 transitions. [2025-01-10 07:02:15,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:15,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1760 states and 3746 transitions. [2025-01-10 07:02:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states and 3746 transitions. [2025-01-10 07:02:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1640. [2025-01-10 07:02:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1031 states have (on average 1.10184287099903) internal successors, (1136), 1116 states have internal predecessors, (1136), 317 states have call successors, (386), 156 states have call predecessors, (386), 292 states have return successors, (1886), 367 states have call predecessors, (1886), 308 states have call successors, (1886) [2025-01-10 07:02:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 3408 transitions. [2025-01-10 07:02:15,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1640 states and 3408 transitions. [2025-01-10 07:02:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 07:02:15,249 INFO L432 stractBuchiCegarLoop]: Abstraction has 1640 states and 3408 transitions. [2025-01-10 07:02:15,249 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-01-10 07:02:15,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1640 states and 3408 transitions. [2025-01-10 07:02:15,253 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 123 [2025-01-10 07:02:15,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:15,253 INFO L119 BuchiIsEmpty]: Starting construction of run